
Planar graphs without 4cycle or chordal6cycle are(3,0,0)colorable
 LIU Jia, SUN Lei

JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2018, 53(12):
3140.
doi:10.6040/j.issn.16719352.0.2017.642

Abstract
(
270 )
PDF (437KB)
(
191
)
Save

References 
Related Articles 
Metrics
Let d_{}1,d_{}2,…,d_{k} be k nonnegative intergers. A graph G is(d_{}1,d_{}2,…,d_{k})colorable, if the vertex set of G can be partitioned into subsets V_{}1,V_{}2,…,V_{k} such that the graph G［V_{i}］ induced by V_{i} has maximum degree at most d_{i} for i=1,2,…,k. There is a conclusion about the coloring of planar graphs: planar graphs without 4cycle or chordal6cycle are(3,0,0)colorable.