Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647274 | Discrete Mathematics | 2014 | 7 Pages |
Abstract
Let d1,d2,â¦,dk be k non-negative integers. A graph G is (d1,d2,â¦,dk)-colorable if the vertex set of G can be partitioned into subsets V1,V2,â¦,Vk such that the subgraph G[Vi] induced by Vi has maximum degree at most di for 1â¤iâ¤k. It is known that planar graphs with cycles of length neither 4 nor k, kâ{5,6}, are (3,0,0)-colorable. In this paper, we show that planar graphs with cycles of length neither 4 nor 7 are also (3,0,0)-colorable.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Huihui Li, Jinghan Xu, Yingqian Wang,