9 citations · 22 across the 13 of their papers we have counts for
14 papers · 1 filter
On the Spectra of Chromatic Number and Chromatic Index of Cyclic Covers
Guantao Chen, Hein van der Holst, Rong Luo +1
For a fixed integer , we study what values of chromatic index and chromatic number can be attained by some -fold cyclic cover of a loopless multigraph. For edge-c…
The Alon-Tarsi Number of Squares of Subcubic Planar Graphs without Cycles of Lengths to
Seog-Jin Kim, Xiaopan Lian, Rong Luo
The Alon--Tarsi number of a graph , defined via the graph polynomial, is a strengthening of the list chromatic number . We study the Alon--Tarsi number of s…
High-Dimensional -Normed Flows
Chenxing Li, Jiaao Li, Rong Luo +1
We generalize Tutte's integer flows and the -dimensional Euclidean flows of Mattiolo, Mazzuoccolo, Rajník, and Tabarelli to \emph{-dimensional -normed nowhere-zero flows}…
Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
Seog-Jin Kim, Rong Luo
The {\em square} of a graph , denoted , has the same vertex set as and an edge between any two vertices at distance at most in . Wegner (1977) conjectured that f…
The average degree of edge chromatic critical graphs with maximum degree seven
Yan Cao, Rong Luo, Zhengke Miao +1
In this paper, by developing several new adjacency lemmas about a path on or vertices, we show that the average degree of 7-critical graphs is at least 6. It implies Vizing…
Decomposition of class II graphs into two class I graphs
Yan Cao, Guangming Jing, Rong Luo +3
Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum -edge-colorable subgraph and a matching.…
Flows of 3-edge-colorable cubic signed graphs
Liangchen Li, Chong Li, Rong Luo +2
Bouchet conjectured in 1983 that every flow-admissible signed graph admits a nowhere-zero 6-flow which is equivalent to the restriction to cubic signed graphs. In this paper, we pr…
Flows on signed graphs without long barbells
You Lu, Rong Luo, Michael Schubert +2
Many basic properties in Tutte's flow theory for unsigned graphs do not have their counterparts for signed graphs. However, signed graphs without long barbells in many ways behave…
Flows on flow-admissible signed graphs
Matt DeVos, Jiaao Li, You Lu +3
In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero -flow. Bouchet himself proved that such signed graphs admit nowhere-zero $21…
Nowhere-zero -flow of graphs with small independence number
Jiaao Li, Rong Luo, Yi Wang
Tutte's -flow conjecture states that every -edge-connected graph admits a nowhere-zero -flow. In this paper, we characterize all graphs with independence number at most $4…
Signed graphs: from modulo flows to integer-valued flows
Jian Cheng, You Lu, Rong Luo +1
Converting modulo flows into integer-valued flows is one of the most critical steps in the study of integer flows. Tutte and Jaeger's pioneering work shows the equivalence of modul…
Equitable coloring of sparse planar graphs
Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens +1
A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. The equitable chromatic threshold of is the smallest int…
Shortest circuit covers of signed graphs
Jian Cheng, You Lu, Rong Luo +1
A shortest circuit cover of a bridgeless graph is a family of circuits that covers every edge of and is of minimum total length. The total length of a shortest c…
A note on strong edge-colorings of 2-degenerate graphs
Rong Luo, Gexin Yu
We show that every 2-degenerate graph with maximum degree has a strong edge-coloring with at most colors.