An extension of Vizing's theorem

DOI10.1002/(SICI)1097-0118(199704)24:4%3C347::AID-JGT7%3E3.0.CO;2-OMaRDI QIDQ3129828zbMATH OpenOpenAlexFDO

Authors

Publication date 5 October 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199704)24:4%3C347::aid-jgt7%3E3.0.co;2-o

zbMATH Keywords

chromatic indexchromatic numbertotal chromatic numbertotal colouring conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 98760
• scientific article; zbMATH DE number 4150186
• The total chromatic number of graphs having large maximum degree

Cited in

(6)

• A generalization of Vizing's theorem on domination
• A \(v\)-analogue of Peel's theorem
• scientific article; zbMATH DE number 7039406 (Why is no real title available?)
• An Extension of Van Der Mond's Theorem and Some Applications
• scientific article; zbMATH DE number 915265 (Why is no real title available?)
• Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture

This page was built for publication: An extension of Vizing's theorem

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