The total chromatic number of split-indifference graphs

DOI10.1016/j.disc.2012.01.019zbMath1246.05054OpenAlexW2002368069MaRDI QIDQ442393

J. Herrera, H. S. Yoon

Publication date: 10 August 2012

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

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

zbMATH Keywords

graph colouringsplit graphstotal chromatic numberindifference graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Total chromatic number of honeycomb network ⋮ Edge-colouring and total-colouring chordless graphs ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Total colorings-a survey ⋮ Counting and enumerating unlabeled split–indifference graphs ⋮ Total coloring of rooted path graphs

Cites Work

• Unnamed Item
• Total-chromatic number and chromatic index of dually chordal graphs
• A total-chromatic number analogue of Plantholt's theorem
• Determining the total colouring number is NP-hard
• Total colouring regular bipartite graphs is NP-hard
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Characterizing and edge-colouring split-indifference graphs
• On edge-colouring indifference graphs
• On the compatibility between a graph and a simple order
• The Colour Numbers of Complete Graphs
• Edge and total coloring of interval graphs

This page was built for publication: The total chromatic number of split-indifference graphs