Total Colourings of Graphs

DOI10.1112/blms/21.2.159zbMath0636.05025OpenAlexW1980409271MaRDI QIDQ3775574

Hian Poh 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

total chromatic numbertotal colouring conjectureTCC

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ Total-colorings of complete multipartite graphs using amalgamations ⋮ Generalization of two results of Hilton on total-colourings of a graph ⋮ On total colorings of some special 1-planar graphs ⋮ The total chromatic number of complete multipartite graphs with low deficiency ⋮ A concise proof for total coloring subcubic graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) ⋮ Unnamed Item ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs ⋮ The total chromatic number of some bipartite graphs ⋮ On total colorings of 1-planar graphs

This page was built for publication: Total Colourings of Graphs