yingqian-wang documents

Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
Documents Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
Plane graphs without cycles of length or 8 are 3-colorable
Documents Plane graphs without cycles of length or 8 are 3-colorable
Decomposing a planar graph with girth at least 8 into a forest and a matching
Documents Decomposing a planar graph with girth at least 8 into a forest and a matching
A note on 3-choosability of planar graphs
Documents A note on 3-choosability of planar graphs
Linear coloring of sparse graphs
Documents Linear coloring of sparse graphs
A sufficient condition for a plane graph with maximum degree 6 to be class 1
Documents A sufficient condition for a plane graph with maximum degree 6 to be class 1