New proof of brooks' theorem

DOI10.1016/S0021-9800(69)80057-8zbMATH Open0186.27703MaRDI QIDQ5580177FDOQ5580177

Authors: Leonid S. Mel'nikov, V. G. Vizing 

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

topology

Cited In (8)

• On equitable \(\Delta\)-coloring of graphs with low average degree
• Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
• A reconfigurations analogue of Brooks' theorem and its consequences
• Chromatic optimisation: Limitations, objectives, uses, references
• Diameter of colorings under Kempe changes
• An extension of Brooks' theorem to n-degenerate graphs
• Brooks' Theorem and Beyond
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs

This page was built for publication: New proof of brooks' theorem

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