![](/img/cover-not-exists.png)
Every planar graph with cycles of length neither 4 nor 5 is\((1,1,0)\)-colorable
Xu, Lingji, Miao, Zhengke, Wang, YingqianVolume:
28
Language:
english
Journal:
Journal of Combinatorial Optimization
DOI:
10.1007/s10878-012-9586-4
Date:
November, 2014
File:
PDF, 304 KB
english, 2014