Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$-colorable.

Saved in:

Bibliographic Details
Title:	Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$-colorable.
Authors:	Xu, Lingji¹ lingjixu@126.com, Miao, Zhengke² zkmiao@jsnu.edu.cn, Wang, Yingqian¹ yqwang@zjnu.cn
Source:	Journal of Combinatorial Optimization. Nov2014, Vol. 28 Issue 4, p774-786. 13p.
Database:	Mathematics Source

Description
ISSN:	13826905
DOI:	10.1007/s10878-012-9586-4