Yue Zhao

Zhengke Miao

J. Graph Theory, 2016

Hamiltonian Cycles in Critical Graphs with Large Maximum Degree.

[BibT_eX]

[DOI]

Zhengke Miao

Graphs Comb., 2016

2013

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

[BibT_eX]

[DOI]

J. Graph Theory, 2013

2011

A new upper bound for the independence number of edge chromatic critical graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = -5.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

2009

The size of edge chromatic critical graphs with maximum degree 6.

[BibT_eX]

[DOI]

Lianying Miao

J. Graph Theory, 2009

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

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

On the flexibility of toroidal embeddings.

[BibT_eX]

[DOI]

Neil Robertson

Xiaoya Zha

J. Comb. Theory, Ser. 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}.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2008

2006

A note on Vizing's independence number conjecture of edge chromatic critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

2004

New lower bounds for the size of edge chromatic critical graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

2003

Coloring edges of graphs embedded in a surface of characteristic zero.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2003

On the edge-reconstruction of graphs embedded in surfaces IV.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2002

On the Size of Edge Chromatic Critical Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2002

2001

On spanning trees and walks of low maximum degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

Planar Graphs of Maximum Degree Seven are Class I.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2001

A New Bound on the Cyclic Chromatic Number.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2001

On Improving the Edge-Face Coloring Theorem.

[BibT_eX]

[DOI]

Graphs Comb., 2001

2000

3-Coloring graphs embedded in surfaces.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Coloring edges of embedded graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

A five-color theorem.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

On total 9-coloring planar graphs of maximum degree seven.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

On cyclic colorings and their generalizations.

[BibT_eX]

[DOI]

Oleg V. Borodin

Discret. Math., 1999

1998

On the Edge Reconstruction of Graphs Embedded in Surfaces, III, .

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1998

On 2-Connected Spanning Subgraphs with Low Maximum Degree.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1998

On \bi d-Diagonal Colorings of Embedded Graphs of Low Maximum Face Size.

[BibT_eX]

[DOI]

Graphs Comb., 1998

1997

On Simultaneous Edge-Face Colorings of Plane Graphs.

[BibT_eX]

Comb., 1997

1996

On d-diagonal colorings.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

1995

On Diagonally 10-Coloring Plane Triangulations.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

A note on the three color problem.

[BibT_eX]

[DOI]

Graphs Comb., 1995

On the edge-reconstruction of 3-connected planar graphs with minimum valency 4.

[BibT_eX]

[DOI]

Discret. Math., 1995

1993

On the edge reconstruction of graphs embedded on surfaces.

[BibT_eX]

[DOI]

Graphs Comb., 1993

1991

On non-null separating circuits in embedded graphs.

[BibT_eX]

Xiaoya Zha