Total and fractional total colourings of circulant graphs

DOI10.1016/j.disc.2007.11.070zbMath1223.05074OpenAlexW1996513598MaRDI QIDQ998370

Olivier Togni, Riadh Khennoufa

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.070

zbMATH Keywords

graph colouringtotal colouringcirculant graphfractional total colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Results about the total chromatic number and the conformability of some families of circulant graphs ⋮ Total colorings-a survey ⋮ Total colorings of circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determining the total colouring number is NP-hard
• Total colouring regular bipartite graphs is NP-hard
• Fractionally colouring total graphs
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total colourings of planar graphs with large girth
• Total colourings of graphs
• Star Extremal Circulant Graphs
• Coloração Total do C²n
• The Colour Numbers of Complete Graphs

This page was built for publication: Total and fractional total colourings of circulant graphs