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

DOI10.1016/J.ENDM.2010.05.085MaRDI QIDQ2883635zbMATH OpenOpenAlexFDO

Authors R. C. S. Machado, Celina M. H. de Figueiredo

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

decompositionrecognitionPetersen graphedge-colouringtotal-colouringHeawood graphcycle with a unique chord

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Total chromatic number of unichord-free graphs
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
• Complexity separating classes for edge-colouring and total-colouring
• Chromatic index of graphs with no cycle with a unique chord
• Clique-colouring and biclique-colouring unichord-free graphs

Cites work

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

Cited in

(9)

• Clique-colouring and biclique-colouring unichord-free graphs
• THE UNIQUE EQUIVALENCE CLASS OF CHROMATIC RECTANGLE FREE 3-COLORINGS OF A 10 × 10 CHESSBOARD
• Complexity separating classes for edge-colouring and total-colouring
• Total colorings-a survey
• Total chromatic number of unichord-free graphs
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
• Complexity-separating graph classes for vertex, edge and total colouring
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs

This page was built for publication: Total chromatic number of \{square,unichord\}-free graphs

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