The total chromatic number of pseudo-Halin graphs with lower degree

DOI10.1016/j.disc.2008.01.018zbMath1177.05043OpenAlexW1996380829MaRDI QIDQ1011742

Xianyong Meng, Rensuo Li, Tao Chen, Bentang Su, Jian-hua Guo

Publication date: 9 April 2009

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

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

zbMATH Keywords

total chromatic numbertotal coloringpseudo-Halin graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Incidence coloring of pseudo-Halin graphs

Cites Work

• Determining the total colouring number is NP-hard
• The total chromatic number of regular graphs of even order and high degree
• Unnamed Item

This page was built for publication: The total chromatic number of pseudo-Halin graphs with lower degree