RLRong Luo
Rong Luo
*This is an algorithmically generated author record based on publicly available information.
Research Subjects
Rong Luo has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Cun-Quan Zhang
Department of Mathematics, West Virginia University, Morgantown, WV 26506 USA
2 shared publications - Gexin Yu
Department of Mathematics William & Mary 23185 Williamsburg VA USA
2 shared publications - Yue Zhao
Department of Mathematics, University of Central Florida, Orlando, FL 32816-1364, USA
2 shared publications - Yue Zhao
Department of Mathematics, University of Central Florida, Orlando, USA
2 shared publications - D. Christopher Stephens
Middle Tennessee State University
1 shared publication - Jean-Sébastien Sereni
Theoretical Bioinformatics, ICube, C.N.R.S., University of Strasbourg, 300 Boulevard Sébastien Brant, 67400 Illkirch, France
1 shared publication
Latest Publications
- Open Access
Equitable coloring of sparse planar graphs
A proper vertex coloring of a graph $G$ is equitable if the sizes of color classes differ by at most one. The equitable chromatic threshold $\chi_{eq}^*(G)$ of $G$ is the smallest integer $m$ such that $G$ is equitably $n$-colorable for all $n\ge m$. We show that for planar graphs $G$ with minimum degree at least two, $\chi_{eq}^*(G)\le 4$ if the girth of $G$ is at least $10$, and $\chi_{eq}^*(G)\le 3$ if the girth of $G$ is at least $14$.Open AccessEquitable coloring of sparse planar graphs
A proper vertex coloring of a graph $G$ is equitable if the sizes of color classes differ by at most one. The equitable chromatic threshold $\chi_{eq}^*(G)$ of $G$ is the smallest integer $m$ such that $G$ is equitably $n$-colorable for all $n\ge m$. We show that for planar graphs $G$ with minimum degree at least two, $\chi_{eq}^*(G)\le 4$ if the girth of $G$ is at least $10$, and $\chi_{eq}^*(G)\le 3$ if the girth of $G$ is at least $14$. - 31 August 2012
- Published by Elsevier in European Journal of Combinatorics
- Vol. 33 (6) , 1078-1085
An extremal problem on group connectivity of graphs
- 31 August 2012
- Published by Elsevier in European Journal of Combinatorics
- Vol. 33 (6) , 1078-1085
An extremal problem on group connectivity of graphs
- 11 July 2012
- Published by Wiley in Journal of Graph Theory
- Vol. 73 (4) , 469-482
A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian-An Approach to Vizing's 2-Factor Conjecture
- 11 July 2012
- Published by Wiley in Journal of Graph Theory
- Vol. 73 (4) , 469-482
A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian-An Approach to Vizing's 2-Factor Conjecture
- 16 December 2010
- Published by Wiley in Journal of Graph Theory
- Vol. 68 (3) , 202-212
A new upper bound for the independence number of edge chromatic critical graphs
- 16 December 2010
- Published by Wiley in Journal of Graph Theory
- Vol. 68 (3) , 202-212
A new upper bound for the independence number of edge chromatic critical graphs
- 12 November 2010
- Published by Wiley in Journal of Graph Theory
- Vol. 68 (2) , 148-168
Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
- 12 November 2010
- Published by Wiley in Journal of Graph Theory
- Vol. 68 (2) , 148-168
Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
- 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
- 4 April 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 49 (3) , 234-256
Edge-face chromatic number and edge chromatic number of simple plane graphs
- 4 April 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 49 (3) , 234-256
Edge-face chromatic number and edge chromatic number of simple plane graphs
- 28 January 2004
- Published by Elsevier in Discrete Mathematics
- Vol. 275 (1-3) , 207-218
Edge coloring of graphs with small average degrees
- 28 January 2004
- Published by Elsevier in Discrete Mathematics
- Vol. 275 (1-3) , 207-218
Edge coloring of graphs with small average degrees
- 1 September 2003
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 19 (3) , 393-401
Edge Coloring of Embedded Graphs with Large Girth
- 1 September 2003
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 19 (3) , 393-401
Edge Coloring of Embedded Graphs with Large Girth