Dichotomy for Coloring of Dart Graphs

DOI10.1007/978-3-642-19222-7_9zbMath1326.05046OpenAlexW1568703699MaRDI QIDQ3000496

Martin Kochol, Riste Škrekovski

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Dichotomy for Coloring of Dart Graphs