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

zbMATH Keywords

classificationmaximum degreetotal chromatic numbercolourTCC

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• Recent results on the total chromatic number
• 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?)

   Recommendations

• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The total chromatic number of graphs having large maximum degree 👍 👎
• Title not available (Why is that?) 👍 👎
• The total chromatic number of graphs of even order and high degree 👍 👎
• 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?) 👍 👎

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)