On non-null separating circuits in embedded graphs. - Xiaoya Zha; Yue Zhao 008 (Graph Structure Theory, 1991)

On the edge reconstruction of graphs embedded on surfaces. - Yue Zhao 008 (Graphs Comb., 1993)

On the edge-reconstruction of 3-connected planar graphs with minimum valency 4. - Yue Zhao 008 (Discret. Math., 1995)

A note on the three color problem. - Daniel P. Sanders 001; Yue Zhao 008 (Graphs Comb., 1995)

On Diagonally 10-Coloring Plane Triangulations. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 1995)

On d-diagonal colorings. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 1996)

On Simultaneous Edge-Face Colorings of Plane Graphs. - Daniel P. Sanders 001; Yue Zhao 008 (Comb., 1997)

On bi d-Diagonal Colorings of Embedded Graphs of Low Maximum Face Size. - Daniel P. Sanders 001; Yue Zhao 008 (Graphs Comb., 1998)

On 2-Connected Spanning Subgraphs with Low Maximum Degree. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 1998)

On the Edge Reconstruction of Graphs Embedded in Surfaces, III, . - Yue Zhao 008 (J. Comb. Theory B, 1998)

On cyclic colorings and their generalizations. - Oleg V. Borodin; Daniel P. Sanders 001; Yue Zhao 008 (Discret. Math., 1999)

On total 9-coloring planar graphs of maximum degree seven. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 1999)

A five-color theorem. - Daniel P. Sanders 001; Yue Zhao 008 (Discret. Math., 2000)

Coloring edges of embedded graphs. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 2000)

3-Coloring graphs embedded in surfaces. - Yue Zhao 008 (J. Graph Theory, 2000)

On Improving the Edge-Face Coloring Theorem. - Daniel P. Sanders 001; Yue Zhao 008 (Graphs Comb., 2001)

A New Bound on the Cyclic Chromatic Number. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2001)

Planar Graphs of Maximum Degree Seven are Class I. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2001)

On spanning trees and walks of low maximum degree. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 2001)

On the Size of Edge Chromatic Critical Graphs. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2002)

Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2002)

On the edge-reconstruction of graphs embedded in surfaces IV. - Yue Zhao 008 (Discret. Math., 2003)

Coloring edges of graphs embedded in a surface of characteristic zero. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2003)

New lower bounds for the size of edge chromatic critical graphs. - Yue Zhao 008 (J. Graph Theory, 2004)

A note on Vizing's independence number conjecture of edge chromatic critical graphs. - Rong Luo; Yue Zhao 008 (Discret. Math., 2006)

Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic epsilon in {-1, -2, -3}. - Rong Luo; Yue Zhao 008 (J. Comb. Theory B, 2008)

On the flexibility of toroidal embeddings. - Neil Robertson 001; Xiaoya Zha; Yue Zhao 008 (J. Comb. Theory B, 2008)

An application of Vizing and Vizing-like adjacency lemmas to Vizing's Independence Number Conjecture of edge chromatic critical graphs. - Rong Luo; Yue Zhao 008 (Discret. Math., 2009)

The size of edge chromatic critical graphs with maximum degree 6. - Rong Luo; Lianying Miao; Yue Zhao 008 (J. Graph Theory, 2009)

Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = -5. - Rong Luo; Yue Zhao 008 (J. Graph Theory, 2011)

A new upper bound for the independence number of edge chromatic critical graphs. - Rong Luo; Yue Zhao 008 (J. Graph Theory, 2011)

A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian - An Approach to Vizing's 2-Factor Conjecture. - Rong Luo; Yue Zhao 008 (J. Graph Theory, 2013)

Hamiltonian Cycles in Critical Graphs with Large Maximum Degree. - Rong Luo; Zhengke Miao; Yue Zhao 008 (Graphs Comb., 2016)

Finding Δ(Σ) for a Surface Σ of Characteristic -4. - Rong Luo; Zhengke Miao; Yue Zhao 008 (J. Graph Theory, 2016)

Finding Δ(Σ) for a Surface Σ of Characteristic -6 and -7. - Katie Horacek; Rong Luo; Zhengke Miao; Yue Zhao 008 (Graphs Comb., 2017)

Upper bounds on the maximum degree of class two graphs on surfaces. - Katie Horacek; Rong Luo; Zhengke Miao; Yue Zhao 008 (Discret. Math., 2020)

Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications. - Yan Cao 001; Rong Luo; Zhengke Miao; Yue Zhao 008 (Discret. Appl. Math., 2023)

The average degree of edge chromatic critical graphs with maximum degree seven. - Yan Cao 001; Rong Luo; Zhengke Miao; Yue Zhao 008 (J. Graph Theory, 2023)

Decomposition of class II graphs into two class I graphs. - Yan Cao 001; Guangming Jing; Rong Luo; Vahan Mkrtchyan; Cun-Quan Zhang; Yue Zhao 008 (Discret. Math., 2023)