A short proof of Brooks’ Theorem for vertex arboricity

DOI10.1016/J.AKCEJ.2019.03.005zbMATH Open1473.05236OpenAlexW2923904201WikidataQ128181170 ScholiaQ128181170MaRDI QIDQ5154607FDOQ5154607

Authors: 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

Recommendations

• A short proof of Nash-Williams' theorem for the arboricity of a graph
• scientific article; zbMATH DE number 221058
• scientific article; zbMATH DE number 3873386
• scientific article; zbMATH DE number 1833071
• A matroid analogue of a theorem of Brooks for graphs
• A short proof of a theorem on degree sets of graphs
• A Note on the Vertex Arboricity of a Graph
• A note on the arboricity of graphs
• Bounds for the vertex linear arboricity
• On Brooks' Theorem for Sparse Graphs

zbMATH Keywords

degeneracyBrooks' theoremvertex arboricityvertex coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The point-arboricity of a graph
• Three short proofs in graph theory
• Critical Point-Arboritic Graphs
• Cores and shells of graphs.
• Brooks' Theorem and Beyond

Cited In (4)

• A different short proof of Brooks' theorem
• Short proofs of classical theorems
• A short proof of Nash-Williams' theorem for the arboricity of a graph
• Extremal decompositions for Nordhaus-Gaddum theorems

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

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