Labelling planar graphs without 4-cycles with a condition on distance two - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Weifan Wang, Leizhen Cai. Labelling planar graphs without 4-cycles with a condition on distance two. Discrete Applied Mathematics, 156(12):2241-2249, 2008. [doi]

The following publications are possibly variants of this publication:

Labeling Planar Graphs without 4, 5-Cycles with a Condition on Distance TwoHai-Yang Zhu, Xin-Zhong Lu, Cui-Qi Wang, Ming Chen. siamdm, 26(1):52-64, 2012. [doi]

Acyclic 5-choosability of planar graphs without 4-cyclesMin Chen, Weifan Wang. DM, 308(24):6216-6225, 2008. [doi]

Planar graphs without 4-cycles are acyclically 6-choosableWeifan Wang, Min Chen. jgt, 61(4):307-323, 2009. [doi]

Labeling Planar Graphs with Conditions on Girth and Distance TwoWeifan Wang, Ko-Wei Lih. siamdm, 17(2):264-275, 2003. [doi]

On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cyclesLan Shen, Yingqian Wang. gc, 25(3):401-407, 2009. [doi]

List edge and list total colorings of planar graphs without 4-cyclesJianfeng Hou, Guizhen Liu, Jiansheng Cai. TCS, 369(1-3):250-255, 2006. [doi]

runs on WebDSL