Planar graphs without 4-cycle or chordal-6-cycle are(3,0,0)-colorable
- LIU Jia, SUN Lei
JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2018, 53(12):
Related Articles |
Let d1,d2,…,dk be k non-negative intergers. 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 graph G［Vi］ induced by Vi has maximum degree at most di for i=1,2,…,k. There is a conclusion about the coloring of planar graphs: planar graphs without 4-cycle or chordal-6-cycle are(3,0,0)-colorable.