Yue Zhao

40 papers Journal 39Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
Decomposition of class II graphs into two class I graphs.
Discret. Math.
Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao
2023 J jnl
The average degree of edge chromatic critical graphs with maximum degree seven.
J. Graph Theory
Yan Cao, Rong Luo, Zhengke Miao, Yue Zhao
2023 J jnl
Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications.
Discret. Appl. Math.
Yan Cao, Rong Luo, Zhengke Miao, Yue Zhao
2022 J jnl
Decomposition of class II graphs into two class I graphs.
CoRR
Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao
2020 J jnl
Upper bounds on the maximum degree of class two graphs on surfaces.
Discret. Math.
Katie Horacek, Rong Luo, Zhengke Miao, Yue Zhao
2017 J jnl
Finding Δ(Σ) for a Surface Σ of Characteristic -6 and -7.
Graphs Comb.
Katie Horacek, Rong Luo, Zhengke Miao, Yue Zhao
2016 J jnl
Finding Δ(Σ) for a Surface Σ of Characteristic -4.
J. Graph Theory
Rong Luo, Zhengke Miao, Yue Zhao
2016 J jnl
Hamiltonian Cycles in Critical Graphs with Large Maximum Degree.
Graphs Comb.
Rong Luo, Zhengke Miao, Yue Zhao
2013 J jnl
A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian - An Approach to Vizing's 2-Factor Conjecture.
J. Graph Theory
Rong Luo, Yue Zhao
2011 J jnl
A new upper bound for the independence number of edge chromatic critical graphs.
J. Graph Theory
Rong Luo, Yue Zhao
2011 J jnl
Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = -5.
J. Graph Theory
Rong Luo, Yue Zhao
2009 J jnl
An application of Vizing and Vizing-like adjacency lemmas to Vizing's Independence Number Conjecture of edge chromatic critical graphs.
Discret. Math.
Rong Luo, Yue Zhao
2009 J jnl
The size of edge chromatic critical graphs with maximum degree 6.
J. Graph Theory
Rong Luo, Lianying Miao, Yue Zhao
2008 J jnl
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 B
Rong Luo, Yue Zhao
2008 J jnl
On the flexibility of toroidal embeddings.
J. Comb. Theory B
Neil Robertson, Xiaoya Zha, Yue Zhao
2006 J jnl
A note on Vizing's independence number conjecture of edge chromatic critical graphs.
Discret. Math.
Rong Luo, Yue Zhao
2004 J jnl
New lower bounds for the size of edge chromatic critical graphs.
J. Graph Theory
Yue Zhao
2003 J jnl
Coloring edges of graphs embedded in a surface of characteristic zero.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2003 J jnl
On the edge-reconstruction of graphs embedded in surfaces IV.
Discret. Math.
Yue Zhao
2002 J jnl
Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2002 J jnl
On the Size of Edge Chromatic Critical Graphs.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2001 J jnl
A New Bound on the Cyclic Chromatic Number.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2001 J jnl
On Improving the Edge-Face Coloring Theorem.
Graphs Comb.
Daniel P. Sanders, Yue Zhao
2001 J jnl
On spanning trees and walks of low maximum degree.
J. Graph Theory
Daniel P. Sanders, Yue Zhao
2001 J jnl
Planar Graphs of Maximum Degree Seven are Class I.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2000 J jnl
3-Coloring graphs embedded in surfaces.
J. Graph Theory
Yue Zhao
2000 J jnl
A five-color theorem.
Discret. Math.
Daniel P. Sanders, Yue Zhao
2000 J jnl
Coloring edges of embedded graphs.
J. Graph Theory
Daniel P. Sanders, Yue Zhao
1999 J jnl
On cyclic colorings and their generalizations.
Discret. Math.
Oleg V. Borodin, Daniel P. Sanders, Yue Zhao
1999 J jnl
On total 9-coloring planar graphs of maximum degree seven.
J. Graph Theory
Daniel P. Sanders, Yue Zhao
1998 J jnl
On 2-Connected Spanning Subgraphs with Low Maximum Degree.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
1998 J jnl
On \bi
Graphs Comb.
Daniel P. Sanders, Yue Zhao
1998 J jnl
On the Edge Reconstruction of Graphs Embedded in Surfaces, III
J. Comb. Theory B
Yue Zhao
1997 J jnl
On Simultaneous Edge-Face Colorings of Plane Graphs.
Comb.
Daniel P. Sanders, Yue Zhao
1996 J jnl
On
J. Graph Theory
Daniel P. Sanders, Yue Zhao
1995 J jnl
A note on the three color problem.
Graphs Comb.
Daniel P. Sanders, Yue Zhao
1995 J jnl
On Diagonally 10-Coloring Plane Triangulations.
J. Graph Theory
Daniel P. Sanders, Yue Zhao
1995 J jnl
On the edge-reconstruction of 3-connected planar graphs with minimum valency 4.
Discret. Math.
Yue Zhao
1993 J jnl
On the edge reconstruction of graphs embedded on surfaces.
Graphs Comb.
Yue Zhao
1991 — conf
On non-null separating circuits in embedded graphs.
Graph Structure Theory
Xiaoya Zha, Yue Zhao