scientific article; zbMATH DE number 4134070
[For the entire collection see Zbl 0693.05025.] This paper is a survey on total colourings, an area of graph theory first introduced by Behzad about twenty years ago. It has the following chapters: Introduction; Results for some well known families of graphs; The total chromatic number conjecture; Upper bounds for the total chromatic number; Graphs which satisfy the conjecture; New results; Small graphs of type 2; Critical graphs. The recent results about total colourings quoted in the paper are due to O. V. Borodin, R. Häggkvist, A. J. W. Hilton, Zhao Cheng, J. K. Dugdale, H. R. Hind, C. M. Mynhardt, M. Rosenfeld, H. P. Yap and the author.
- Total chromatic number of graphs of odd order and high degree
- Total colorings of degenerate graphs
- Generalized fractional total colorings of graphs
- Total-colorings of complete multipartite graphs using amalgamations
- Total colorings of some multi-join graphs
- Total colorings of some join graphs
- The history of the total chromatic number conjecture
- scientific article; zbMATH DE number 5556311 (Why is no real title available?)
- scientific article; zbMATH DE number 4053646 (Why is no real title available?)
- scientific article; zbMATH DE number 742644 (Why is no real title available?)
- scientific article; zbMATH DE number 810478 (Why is no real title available?)
- scientific article; zbMATH DE number 842882 (Why is no real title available?)
- scientific article; zbMATH DE number 867691 (Why is no real title available?)
- Total coloring of the prismatic graphs
- Total coloring of quasi-line graphs and inflated graphs
- Colouring Powers of Paths
- scientific article; zbMATH DE number 6605085 (Why is no real title available?)
- All totally symmetric colored graphs
- An upper bound for total colouring of graphs
- Coloring the Cartesian sum of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035308)