List-colouring the square of a K4-minor-free graph

@article{Hetherington2008ListcolouringTS,
  title={List-colouring the square of a K4-minor-free graph},
  author={Timothy J. Hetherington and Douglas R. Woodall},
  journal={Discrete Mathematics},
  year={2008},
  volume={308},
  pages={4037-4043}
}
Let G be a K4-minor-free graph with maximum degree . It is known that if ∈ {2, 3} then G2 is ( + 2)-degenerate, so that (G2) ch(G2) + 3. It is also known that if 4 then G2 is ( 3 2 + 1)-degenerate and (G2) 3 2 + 1. It is proved here that if 4 then G2 is 3 2 -degenerate and ch(G2) 3 2 + 1. These results are sharp. © 2007 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.
7 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

A property of 4-chromatic graphs and some remarks on critical graphs

  • G. A. Dirac
  • J. London Math. Soc. 27
  • 1952
Highly Influential
3 Excerpts

List colourings of graphs

  • D. R. Woodall
  • in: J.W.P. Hirschfeld (Ed.), Surveys in…
  • 2001
1 Excerpt

Dirac , A property of 4 - chromatic graphs and some remarks on critical graphs

  • D. R. Woodall A. V. Kostochka
  • J . London Math . Soc .
  • 1952

Similar Papers

Loading similar papers…