| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648365 | Discrete Mathematics | 2009 | 13 Pages |
Abstract
Refining a bound by Lih, Wang and Zhu, we prove that if the square G2G2 of a K4K4-minor-free graph GG with maximum degree Δ⩾6Δ⩾6 does not contain a complete subgraph on ⌊32Δ⌋+1 vertices, then G2G2 is ⌊32Δ⌋-colorable.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Alexandr V. Kostochka, Lale Özkahya, Douglas R. Woodall,