A short proof of Brooks’ Theorem for vertex arboricity

DOI10.1016/j.akcej.2019.03.005zbMath1473.05236OpenAlexW2923904201WikidataQ128181170 ScholiaQ128181170MaRDI QIDQ5154607

Allan Bickle

Publication date: 5 October 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.03.005

zbMATH Keywords

degeneracyvertex coloringBrooks' theoremvertex arboricity

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Extremal decompositions for Nordhaus-Gaddum theorems

Cites Work

• Unnamed Item
• Three short proofs in graph theory
• The point-arboricity of a graph
• Brooks' Theorem and Beyond
• Critical Point-Arboritic Graphs
• Cores and shells of graphs

This page was built for publication: A short proof of Brooks’ Theorem for vertex arboricity