Distance Constraints on Short Cycles for 3-Colorability of Planar graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Ying-li Kang, Yingqian Wang. Distance Constraints on Short Cycles for 3-Colorability of Planar graphs. Graphs and Combinatorics, 31(5):1497-1505, 2015. [doi]

The following publications are possibly variants of this publication:

On 3-colorable planar graphs without short cyclesMin Chen, Weifan Wang. appml, 21(9):961-965, 2008. [doi]

Three-coloring planar graphs without short cyclesMin Chen, André Raspaud, Weifan Wang. ipl, 101(3):134-138, 2007. [doi]

On the 3-colorability of planar graphs without 4-, 7- and 9-cyclesHuajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud. DM, 309(13):4596-4607, 2009. [doi]

The 3-colorability of planar graphs without cycles of length 4, 6 and 9Ying-li Kang, Ligang Jin, Yingqian Wang. DM, 339(1):299-307, 2016. [doi]

runs on WebDSL