1 citations · 1 across the 3 of their papers we have counts for
5 papers
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…