Total chromatic number of {square,unichord}-free graphs

DOI10.1016/j.endm.2010.05.085zbMath1236.05084MaRDI QIDQ2883635

Celina M. Herrera de Figueiredo, Raphael C. S. Machado

Publication date: 13 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.085

zbMATH Keywords

decomposition; edge-colouring; recognition; Petersen graph; total-colouring; Heawood graph; cycle with a unique chord

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs, Total chromatic number of unichord-free graphs, The P versus NP-complete dichotomy of some challenging problems in graph theory, Complexity separating classes for edge-colouring and total-colouring

Cites Work

• Unnamed Item
• Unnamed Item
• Total 4-choosability of series-parallel graphs
• Edge and total choosability of near-outerplanar graphs
• Determining the total colouring number is NP-hard
• The total coloring of a multigraph with maximal degree 4
• Total colouring regular bipartite graphs is NP-hard
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total colourings of graphs
• The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
• Total chromatic number of one kind of join graphs
• On the total coloring of certain graphs
• Total chromatic number of planar graphs with maximum degree ten
• A structure theorem for graphs with no cycle with a unique chord and its consequences
• On Total Chromatic Number of a Graph