Total Colourings of Graphs

DOI10.1112/BLMS/21.2.159MaRDI QIDQ3775574zbMATH OpenOpenAlexFDO

Authors H. P. Yap

Publication date 1989

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/blms/21.2.159

zbMATH Keywords

TCCtotal chromatic numbertotal colouring conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The total chromatic number of graphs having large maximum degree
• Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
• scientific article; zbMATH DE number 98760
• Recent developments in total colouring
• Total colourings of graphs

Cited in

(27)

• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• Generalization of two results of Hilton on total-colourings of a graph
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs
• On total colorings of 1-planar graphs
• Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
• On total colorings of some special 1-planar graphs
• A concise proof for total coloring subcubic graphs
• Total colorings of degenerate graphs
• Total-colorings of complete multipartite graphs using amalgamations
• Total colorings of some multi-join graphs
• The total chromatic number of some bipartite graphs
• 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?)
• Randomly colouring graphs (a combinatorial view)
• scientific article; zbMATH DE number 810478 (Why is no real title available?)
• Total coloring of the prismatic graphs
• Total coloring of quasi-line graphs and inflated graphs
• scientific article; zbMATH DE number 2230302 (Why is no real title available?)
• scientific article; zbMATH DE number 6605085 (Why is no real title available?)
• All totally symmetric colored graphs
• On total chromatic number of complete multipartite graphs
• Total colorings of complete multipartite graphs using amalgamations
• A sufficient condition for complete multipartite graphs to be of type 1
• On total chromatic number of complete multipartite graphs
• The total chromatic number of complete multipartite graphs with low deficiency
• Coloring the Cartesian sum of graphs

This page was built for publication: Total Colourings of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775574)