Yue Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yue Zhao has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Rong Luo
School of Mathematical Sciences, Xuzhou Normal University, Xuzhou, Jiangsu, 221116, China
2 shared publications Daniel P. Sanders
23 Cliff Road, Belle Terre, NY 11777, USA
1 shared publication- Daniel P. Sanders
23 Cliff Road Belle Terre, New York
1 shared publication - Lianying Miao
School of Mathematics, China University of Mining and Technology, Xuzhou 221116, Jiangsu, China
1 shared publication - Sanders
23 Cliff Road, Belle Terre, NY 11777, USA. US
1 shared publication
Latest Publications
- 27 August 2008
- Published by Wiley in Journal of Graph Theory
- Vol. 60 (2) , 149-171
The size of edge chromatic critical graphs with maximum degree 6
In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117–134; Russian Math Surveys 23 (1968), 125–142] conjectured that for any edge chromatic critical graph ${{G}} = ({{V}}, {{E}})$ with maximum degree $\Delta$ , $|{{E}}| \geq {{{1}}\over {{2}}}\{(\Delta {{- 1}})|{{V}}| + {{3}}\}$ . This conjecture has been verified for $\Delta \leq {{5}}$ . In this article, by applying the discharging method, we prove the conjecture for $\Delta = {{6}}$ . © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 149–171, 2009- 27 August 2008
- Published by Wiley in Journal of Graph Theory
- Vol. 60 (2) , 149-171
The size of edge chromatic critical graphs with maximum degree 6
In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117–134; Russian Math Surveys 23 (1968), 125–142] conjectured that for any edge chromatic critical graph ${{G}} = ({{V}}, {{E}})$ with maximum degree $\Delta$ , $|{{E}}| \geq {{{1}}\over {{2}}}\{(\Delta {{- 1}})|{{V}}| + {{3}}\}$ . This conjecture has been verified for $\Delta \leq {{5}}$ . In this article, by applying the discharging method, we prove the conjecture for $\Delta = {{6}}$ . © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 149–171, 2009- 6 August 2006
- Published by Elsevier in Discrete Mathematics
- Vol. 306 (15) , 1788-1790
A note on Vizing's independence number conjecture of edge chromatic critical graphs
- 6 August 2006
- Published by Elsevier in Discrete Mathematics
- Vol. 306 (15) , 1788-1790
A note on Vizing's independence number conjecture of edge chromatic critical graphs
- 7 April 2004
- Published by Wiley in Journal of Graph Theory
- Vol. 46 (2) , 81-92
New lower bounds for the size of edge chromatic critical graphs
In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Δ. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004
- 7 April 2004
- Published by Wiley in Journal of Graph Theory
- Vol. 46 (2) , 81-92
New lower bounds for the size of edge chromatic critical graphs
In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Δ. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004
- 19 December 2002
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 87 (2) , 254-263
Coloring edges of graphs embedded in a surface of characteristic zero
- 19 December 2002
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 87 (2) , 254-263
Coloring edges of graphs embedded in a surface of characteristic zero
- 1 June 2001
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 17 (2) , 329-341
On Improving the Edge-Face Coloring Theorem
- 1 June 2001
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 17 (2) , 329-341
On Improving the Edge-Face Coloring Theorem
- 1 February 2001
- Published by Wiley in Journal of Graph Theory
- Vol. 36 (2) , 67-74
On spanning trees and walks of low maximum degree
- 1 February 2001
- Published by Wiley in Journal of Graph Theory
- Vol. 36 (2) , 67-74
On spanning trees and walks of low maximum degree