Yue Zhao

Affiliations:
  • University of Central Florida, Department of Mathematics, Orlando, FL, USA
  • Ohio State University, Department of Mathematics, Columbus, OH, USA (PhD 1992)


According to our database1, Yue Zhao authored at least 39 papers between 1991 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Decomposition of class II graphs into two class I graphs.
Discret. Math., December, 2023

The average degree of edge chromatic critical graphs with maximum degree seven.
J. Graph Theory, July, 2023

Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications.
Discret. Appl. Math., April, 2023

2020
Upper bounds on the maximum degree of class two graphs on surfaces.
Discret. Math., 2020

2017
Finding Δ(Σ) for a Surface Σ of Characteristic -6 and -7.
Graphs Comb., 2017

2016
Finding Δ(Σ) for a Surface Σ of Characteristic -4.
J. Graph Theory, 2016

Hamiltonian Cycles in Critical Graphs with Large Maximum Degree.
Graphs Comb., 2016

2013
A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian - An Approach to Vizing's 2-Factor Conjecture.
J. Graph Theory, 2013

2011
A new upper bound for the independence number of edge chromatic critical graphs.
J. Graph Theory, 2011

Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = -5.
J. Graph Theory, 2011

2009
The size of edge chromatic critical graphs with maximum degree 6.
J. Graph Theory, 2009

An application of Vizing and Vizing-like adjacency lemmas to Vizing's Independence Number Conjecture of edge chromatic critical graphs.
Discret. Math., 2009

2008
On the flexibility of toroidal embeddings.
J. Comb. Theory B, 2008

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, 2008

2006
A note on Vizing's independence number conjecture of edge chromatic critical graphs.
Discret. Math., 2006

2004
New lower bounds for the size of edge chromatic critical graphs.
J. Graph Theory, 2004

2003
Coloring edges of graphs embedded in a surface of characteristic zero.
J. Comb. Theory B, 2003

On the edge-reconstruction of graphs embedded in surfaces IV.
Discret. Math., 2003

2002
Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart.
J. Comb. Theory B, 2002

On the Size of Edge Chromatic Critical Graphs.
J. Comb. Theory B, 2002

2001
On spanning trees and walks of low maximum degree.
J. Graph Theory, 2001

Planar Graphs of Maximum Degree Seven are Class I.
J. Comb. Theory B, 2001

A New Bound on the Cyclic Chromatic Number.
J. Comb. Theory B, 2001

On Improving the Edge-Face Coloring Theorem.
Graphs Comb., 2001

2000
3-Coloring graphs embedded in surfaces.
J. Graph Theory, 2000

Coloring edges of embedded graphs.
J. Graph Theory, 2000

A five-color theorem.
Discret. Math., 2000

1999
On total 9-coloring planar graphs of maximum degree seven.
J. Graph Theory, 1999

On cyclic colorings and their generalizations.
Discret. Math., 1999

1998
On the Edge Reconstruction of Graphs Embedded in Surfaces, III<sup>, </sup>.
J. Comb. Theory B, 1998

On 2-Connected Spanning Subgraphs with Low Maximum Degree.
J. Comb. Theory B, 1998

On \bi <i>d</i>-Diagonal Colorings of Embedded Graphs of Low Maximum Face Size.
Graphs Comb., 1998

1997
On Simultaneous Edge-Face Colorings of Plane Graphs.
Comb., 1997

1996
On <i>d</i>-diagonal colorings.
J. Graph Theory, 1996

1995
On Diagonally 10-Coloring Plane Triangulations.
J. Graph Theory, 1995

A note on the three color problem.
Graphs Comb., 1995

On the edge-reconstruction of 3-connected planar graphs with minimum valency 4.
Discret. Math., 1995

1993
On the edge reconstruction of graphs embedded on surfaces.
Graphs Comb., 1993

1991
On non-null separating circuits in embedded graphs.
Proceedings of the Graph Structure Theory, 1991


  Loading...