Title of article :
A Brooks-type bound for squares of -minor-free graphs
Author/Authors :
Kostochka، نويسنده , , Alexandr V. and ضzkahya، نويسنده , , Lale and Woodall، نويسنده , , Douglas R.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Abstract :
Refining a bound by Lih, Wang and Zhu, we prove that if the square G 2 of a K 4 -minor-free graph G with maximum degree Δ ⩾ 6 does not contain a complete subgraph on ⌊ 3 2 Δ ⌋ + 1 vertices, then G 2 is ⌊ 3 2 Δ ⌋ -colorable.
Keywords :
chromatic number , Vertex coloring , Brooks-type bound , square of a graph , Series–parallel graph
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
