Yingqian Wang

most cited(1,0,0)-colorability of planar graphs without cycles of length 4 or 6

3 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2020★ 3 cited

(1,0,0)-colorability of planar graphs without cycles of length 4 or 6

Ligang Jin, Yingli Kang, Peipei Liu +1

A graph $G$ is $(d_{1}, d_{2}, d_{3})$ -colorable if the vertex set $V (G)$ can be partitioned into three subsets $V_{1}, V_{2}$ and $V_{3}$ such that for $i \in {1, 2, 3}$ , the induced graph $G[V_i]…

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…