Brooks' theorem for generalized dart graphs
From MaRDI portal
Publication:413285
DOI10.1016/j.ipl.2011.11.010zbMath1239.05070OpenAlexW2080337943MaRDI QIDQ413285
Martin Kochol, Riste Škrekovski
Publication date: 4 May 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.010
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three short proofs in graph theory
- Some simplified NP-complete graph problems
- A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
- Δ-List Vertex Coloring in Linear Time
- The 3-Colorability Problem on Graphs with Maximum Degree Four
This page was built for publication: Brooks' theorem for generalized dart graphs
