Title of article
Coloring the square of a K4-minor free graph
Author/Authors
Ko-Wei Lih، نويسنده , , Weifan Wang، نويسنده , , Xuding Zhu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
7
From page
303
To page
309
Abstract
Let G be a K4-minor free graph with maximum degree Δ. We prove that the chromatic number of the square of G is at most (i) Δ+3 if 2⩽Δ⩽3; or (ii) ⌊3Δ/2⌋+1 if Δ⩾4. Examples are given to show the bounds can be attained.
Keywords
K4-minor free graph , Series–parallel graph , Square , Chromatic number
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949221
Link To Document