Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$-colorable.
Saved in:
| Title: | Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$-colorable. |
|---|---|
| Authors: | Xu, Lingji1 lingjixu@126.com, Miao, Zhengke2 zkmiao@jsnu.edu.cn, Wang, Yingqian1 yqwang@zjnu.cn |
| Source: | Journal of Combinatorial Optimization. Nov2014, Vol. 28 Issue 4, p774-786. 13p. |
| Database: | Mathematics Source |
Be the first to leave a comment!
