2 citations · 3 across the 11 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Hajós-like theorem for signed graphs
Yingli Kang
The paper designs five graph operations, and proves that every signed graph with chromatic number can be obtained from all-positive complete graphs by repeatedly appl…
math.CO2017
Remarks on planar edge-chromatic critical graphs
Ligang Jin, Yingli Kang, Eckhard Steffen
The only open case of Vizing's conjecture that every planar graph with is a class 1 graph is . We give a short proof of the following statement: there is no 6-criti…
math.CO2017
Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
Ligang Jin, Yingli Kang, Michael Schubert +1
Listed as No. 53 among the one hundred famous unsolved problems in [J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, Berlin, 2008] is Steinberg's conjecture, which states that…