Yue Zhao

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 8

Top Topics

Uniform Convergence

Linear Functions

Top Venues

J. Graph Theory

Publications

Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao
Decomposition of class II graphs into two class I graphs. Discret. Math. 346 (12) (2023)
Yan Cao, Rong Luo, Zhengke Miao, Yue Zhao
The average degree of edge chromatic critical graphs with maximum degree seven. J. Graph Theory 103 (3) (2023)
Yan Cao, Rong Luo, Zhengke Miao, Yue Zhao
Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications. Discret. Appl. Math. 329 (2023)
Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao
Decomposition of class II graphs into two class I graphs. CoRR (2022)
Katie Horacek, Rong Luo, Zhengke Miao, Yue Zhao
Upper bounds on the maximum degree of class two graphs on surfaces. Discret. Math. 343 (3) (2020)
Katie Horacek, Rong Luo, Zhengke Miao, Yue Zhao
Finding Δ(Σ) for a Surface Σ of Characteristic -6 and -7. Graphs Comb. 33 (4) (2017)
Rong Luo, Zhengke Miao, Yue Zhao
Finding Δ(Σ) for a Surface Σ of Characteristic -4. J. Graph Theory 83 (3) (2016)
Rong Luo, Zhengke Miao, Yue Zhao
Hamiltonian Cycles in Critical Graphs with Large Maximum Degree. Graphs Comb. 32 (5) (2016)
Rong Luo, Yue Zhao
A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian - An Approach to Vizing's 2-Factor Conjecture. J. Graph Theory 73 (4) (2013)
Rong Luo, Yue Zhao
Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = -5. J. Graph Theory 68 (2) (2011)
Rong Luo, Yue Zhao
A new upper bound for the independence number of edge chromatic critical graphs. J. Graph Theory 68 (3) (2011)
Rong Luo, Yue Zhao
An application of Vizing and Vizing-like adjacency lemmas to Vizing's Independence Number Conjecture of edge chromatic critical graphs. Discret. Math. 309 (9) (2009)
Rong Luo, Lianying Miao, Yue Zhao
The size of edge chromatic critical graphs with maximum degree 6. J. Graph Theory 60 (2) (2009)
Neil Robertson, Xiaoya Zha, Yue Zhao
On the flexibility of toroidal embeddings. J. Comb. Theory, Ser. B 98 (1) (2008)
Rong Luo, Yue Zhao
Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic epsilon in {-1, -2, -3}. J. Comb. Theory, Ser. B 98 (4) (2008)
Rong Luo, Yue Zhao
A note on Vizing's independence number conjecture of edge chromatic critical graphs. Discret. Math. 306 (15) (2006)
Yue Zhao
New lower bounds for the size of edge chromatic critical graphs. J. Graph Theory 46 (2) (2004)
Daniel P. Sanders, Yue Zhao
Coloring edges of graphs embedded in a surface of characteristic zero. J. Comb. Theory, Ser. B 87 (2) (2003)
Yue Zhao
On the edge-reconstruction of graphs embedded in surfaces IV. Discret. Math. 263 (1-3) (2003)
Daniel P. Sanders, Yue Zhao
Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart. J. Comb. Theory, Ser. B 85 (2) (2002)
Daniel P. Sanders, Yue Zhao
On the Size of Edge Chromatic Critical Graphs. J. Comb. Theory, Ser. B 86 (2) (2002)
Daniel P. Sanders, Yue Zhao
A New Bound on the Cyclic Chromatic Number. J. Comb. Theory, Ser. B 83 (1) (2001)
Daniel P. Sanders, Yue Zhao
On Improving the Edge-Face Coloring Theorem. Graphs Comb. 17 (2) (2001)
Daniel P. Sanders, Yue Zhao
On spanning trees and walks of low maximum degree. J. Graph Theory 36 (2) (2001)
Daniel P. Sanders, Yue Zhao
Planar Graphs of Maximum Degree Seven are Class I. J. Comb. Theory, Ser. B 83 (2) (2001)
Yue Zhao
3-Coloring graphs embedded in surfaces. J. Graph Theory 33 (3) (2000)
Daniel P. Sanders, Yue Zhao
A five-color theorem. Discret. Math. 220 (1-3) (2000)
Daniel P. Sanders, Yue Zhao
Coloring edges of embedded graphs. J. Graph Theory 35 (3) (2000)
Daniel P. Sanders, Yue Zhao
On total 9-coloring planar graphs of maximum degree seven. J. Graph Theory 31 (1) (1999)
Oleg V. Borodin, Daniel P. Sanders, Yue Zhao
On cyclic colorings and their generalizations. Discret. Math. 203 (1-3) (1999)
Daniel P. Sanders, Yue Zhao
On 2-Connected Spanning Subgraphs with Low Maximum Degree. J. Comb. Theory, Ser. B 74 (1) (1998)
Daniel P. Sanders, Yue Zhao
-Diagonal Colorings of Embedded Graphs of Low Maximum Face Size. Graphs Comb. 14 (1) (1998)
Yue Zhao
. J. Comb. Theory, Ser. B 74 (2) (1998)
Daniel P. Sanders, Yue Zhao
On Simultaneous Edge-Face Colorings of Plane Graphs. Comb. 17 (3) (1997)
Daniel P. Sanders, Yue Zhao
-diagonal colorings. J. Graph Theory 22 (2) (1996)
Daniel P. Sanders, Yue Zhao
On Diagonally 10-Coloring Plane Triangulations. J. Graph Theory 20 (1) (1995)
Daniel P. Sanders, Yue Zhao
A note on the three color problem. Graphs Comb. 11 (1) (1995)
Yue Zhao
On the edge-reconstruction of 3-connected planar graphs with minimum valency 4. Discret. Math. 137 (1-3) (1995)
Yue Zhao
On the edge reconstruction of graphs embedded on surfaces. Graphs Comb. 9 (2-4) (1993)
Xiaoya Zha, Yue Zhao
On non-null separating circuits in embedded graphs. Graph Structure Theory (1991)