9 citations · 22 across the 13 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.CO2022
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.…
math.CO2022
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…