Short proofs of classical theorems

DOI10.1002/JGT.10135MaRDI QIDQ4446889zbMATH OpenOpenAlexFDO

Authors J. A. Bondy

Publication date 3 February 2004

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10135

zbMATH Keywords

Brooks' theoremdepth-first-searchdiameterdigraphssemi-kernelsVizing's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A different short proof of Brooks' theorem
• Brooks' Theorem and Beyond
• A new tool for proving Vizing's theorem
• A short proof of Brooks’ Theorem for vertex arboricity
• scientific article; zbMATH DE number 4087697

Cited in

(11)

• Minimal from classical proofs
• A note on quasi-kernels in digraphs
• A different short proof of Brooks' theorem
• Tournaments and Semicomplete Digraphs
• Locally Semicomplete Digraphs and Generalizations
• Domination in digraphs
• Brooks' Theorem and Beyond
• Algorithmic aspects of small quasi-kernels
• On the structure of Hamiltonian graphs with small independence number
• Generalized quasikernels in digraphs
• On the small quasi-kernel conjecture -- a survey

This page was built for publication: Short proofs of classical theorems

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