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

DOI10.1112/JLMS/52.3.434MaRDI QIDQ4894516zbMATH OpenOpenAlexFDO

Authors

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

classificationcolourmaximum degreeTCCtotal chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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; zbMATH DE number 4085672
• scientific article; zbMATH DE number 1190988
• scientific article; zbMATH DE number 1189240

Cited in

(13)

• The total chromatic number of pseudo-Halin graphs with lower degree
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• Total chromatic number of graphs of odd order and high degree
• scientific article; zbMATH DE number 4150186 (Why is no real title available?)
• Total Colourings of Graphs
• scientific article; zbMATH DE number 4108788 (Why is no real title available?)
• scientific article; zbMATH DE number 26318 (Why is no real title available?)
• The total chromatic number of split-indifference graphs
• scientific article; zbMATH DE number 2059716 (Why is no real title available?)
• scientific article; zbMATH DE number 1852751 (Why is no real title available?)
• scientific article; zbMATH DE number 819131 (Why is no real title available?)
• Total chromatic number of honeycomb network
• Recent results on the total chromatic number

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)