Fan Yang

Follow

Generating author description...

All published works
Action Title Year Authors
+ Embedding clique subdivisions via crux 2025 Donglei Yang
Fan Yang
+ PDF Chat 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz 2023 Fan Yang
Yue Wang
Jianliang Wu
+ The linear arboricity of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e247" altimg="si15.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-minor free graphs 2022 Fan Yang
Jianliang Wu
Huimin Song
+ PDF Chat On the size of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e174" altimg="si30.svg"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>-co-critical graphs 2022 Hunter Davenport
Zi‐Xia Song
Fan Yang
+ PDF Chat On Sufficient Conditions for Planar Graphs to be 5-Flexible 2022 Fan Yang
+ PDF Chat The total coloring of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e360" altimg="si16.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-minor-free graphs 2022 Fan Yang
Jianliang Wu
+ On the size of $(K_t, K_{1,k})$-co-critical graphs 2021 Hunter Davenport
Zi‐Xia Song
Fan Yang
+ Flexibility of planar graphs without $C_4$ and $C_5$ 2020 Donglei Yang
Fan Yang
+ Online and Random Domination of Graphs 2015 Christopher Coscia
Jonathan DeWitt
Fan Yang
Yiguang Zhang
+ Best and worst case permutations for random online domination of the path 2015 Christopher Coscia
Jonathan DeWitt
Fan Yang
Yiguang Zhang
+ Best and worst case permutations for random online domination of the path 2015 Christopher Coscia
Jonathan DeWitt
Fan Yang
Yiguang Zhang
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Every Planar Graph Is 5-Choosable 1994 Carsten Thomassen
3
+ PDF Chat Saturation numbers for families of Ramsey-minimal graphs 2011 Guantao Chen
Michael Ferrara
Ronald J. Gould
Colton Magnant
John R. Schmitt
2
+ Minimal <i>k</i>‐saturated and color critical graphs of prescribed minimum degree 1986 Dwight Duffus
D. Hanson
2
+ PDF Chat Saturated Graphs of Prescribed Minimum Degree 2016 A. Nicholas Day
2
+ Tree‐complete graph ramsey numbers 1977 Vašek Chvátal
2
+ A Survey of Minimum Saturated Graphs 2011 Jill R. Faudree
Ralph J. Faudree
John R. Schmitt
2
+ PDF Chat A Theorem on <i>k</i>-Saturated Graphs 1965 A. Hajnal
2
+ Edge‐colored saturated graphs 1987 D. Hanson
Bjarne Toft
2
+ Ramsey-minimal saturation numbers for matchings 2014 Michael Ferrara
Jaehoon Kim
Elyse Yeager
2
+ Saturation numbers for Ramsey-minimal graphs 2018 Martin Rolek
Zi‐Xia Song
2
+ Hamiltonian circuits in random graphs 1976 L. Pósa
1
+ A Question of Protocol 1988 I. Z. Bouwer
Z. Star
1
+ COVERING AND PACKING IN GRAPHS, I. 1970 Frank Harary
1
+ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic 2013 Huijuan Wang
Bin Liu
Jianliang Wu
Bing Wang
1
+ PDF Chat Dependent random choice 2010 Jacob Fox
Benny Sudakov
1
+ Linear arboricity of digraphs 1987 Ami Nakayama
Bernard Péroche
1
+ SOME UNSOLVED PROBLEMS IN GRAPH THEORY 1968 V. G. Vizing
1
+ PDF Chat Total-Coloring of Plane Graphs with Maximum Degree Nine 2008 Łukasz Kowalik
Jean‐Sébastien Sereni
Riste Škrekovski
1
+ Probabilistic methods in coloring and decomposition problems 1994 Noga Alon
1
+ Covering and packing in graphs IV: Linear arboricity 1981 Jin Akiyama
Geoffrey Exoo
Frank Harary
1
+ Permutations with short monotone subsequences 2006 Dan Romik
1
+ Über eine Eigenschaft der ebenen Komplexe 1937 Klaus W. Wagner
1
+ Improved Bounds for Topological Cliques in Graphs of Large Girth 2006 Daniela Kühn
Deryk Osthus
1
+ Linear Arboricity and Linear k-Arboricity of Regular Graphs 2001 Noga Alon
Vanessa Teague
N. C. Wormald
1
+ Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs 1998 B. Bollobás
Andrew Thomason
1
+ On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles 2009 Lan Shen
Yingqian Wang
1
+ PDF Chat The linear arboricity of graphs 1988 Noga Alon
1
+ Linear arboricity for graphs with multiple edges 1987 H. Bencherif Ait-Djafer
1
+ PDF Chat A Survey of Stack-Sorting Disciplines 2003 Miklós Bóna
1
+ Topological cliques in graphs II 1996 János Komlós
Endre Szemerédi
1
+ PDF Chat Minors in Expanding Graphs 2009 Michael Krivelevich
Benny Sudakov
1
+ PDF Chat Cycle lengths in sparse graphs 2008 Benny Sudakov
Jacques Verstraëte
1
+ PDF Chat On the Domination Number of a Random Graph 2001 Ben Wieland
Anant P. Godbole
1
+ PDF Chat Subdivisions of a large clique in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs 2014 József Balogh
Hong Liu
Maryam Sharifzadeh
1
+ Total coloring of embedded graphs of maximum degree at least ten 2010 Jianfeng Hou
Jianliang Wu
Guizhen Liu
Bin Liu
1
+ PDF Chat Complexité de l'arboricité linéaire d'un graphe 1982 Bernard Péroche
1
+ Linear arboricity of regular digraphs 2016 Wei Hua He
Hao Li
Yandong Bai
Qiang Sun
1
+ Covering and packing in graphs. III: Cyclic and acyclic invariants 1980 Jin Akiyama
Geoffrey Exoo
Frank Harary
1
+ The linear arboricity of $10$-regular graphs 1986 Filip Guldan
1
+ Irregularities of partitions 1990 Gian‐Carlo Rota
1
+ PDF Chat Combinatorial Nullstellensatz 1999 Noga Alon
1
+ PDF Chat Flexibility of triangle‐free planar graphs 2020 Zdeněk Dvořák
Tomáš Masařík
Jan Musílek
Ondřej Pangrác
1
+ PDF Chat A Planar linear arboricity conjecture 2011 Marek Cygan
Jianfeng Hou
Łukasz Kowalik
Borut Lužar
Jianliang Wu
1
+ Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 2017 Zdeněk Dvořák
Luke Postle
1
+ Steinberg's Conjecture is false 2016 Vincent Cohen-Addad
Michael Hebdige
Daniel Kráľ
Zhentao Li
Esteban Salgado
1
+ PDF Chat Towards the linear arboricity conjecture 2019 Asaf Ferber
Jacob Fox
Vishesh Jain
1
+ PDF Chat Logarithmically small minors and topological minors 2014 Richard Montgomery
1
+ PDF Chat Cycle Lengths in Expanding Graphs 2020 Limor Friedman
Michael Krivelevich
1
+ PDF Chat On the Size of $(K_t,\mathcal{T}_k)$-Co-Critical Graphs 2021 Zi‐Xia Song
Jingmei Zhang
1
+ PDF Chat A proof of Mader's conjecture on large clique subdivisions in C4-free graphs 2017 Hong Liu
Richard Montgomery
1