Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1

DOI10.1112/JLMS/52.3.434zbMATH Open0855.05061OpenAlexW2069398710MaRDI QIDQ4894516FDOQ4894516

Author name not available (Why is that?)

Publication date: 26 January 1997

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/52.3.434

Recommendations

• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• scientific article; zbMATH DE number 26318
• scientific article; zbMATH DE number 819131
• The total chromatic number of graphs having large maximum degree
• scientific article; zbMATH DE number 798659
• The total chromatic number of graphs of even order and high degree
• Total chromatic number of graphs of odd order and high degree
• scientific article
• scientific article
• scientific article

zbMATH Keywords

classificationmaximum degreetotal chromatic numbercolourTCC

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (11)

• Recent results on the total chromatic number
• Title not available (Why is that?)
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• Total chromatic number of graphs of odd order and high degree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total Colourings of Graphs
• The total chromatic number of pseudo-Halin graphs with lower degree

This page was built for publication: Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1

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