Dichotomy for coloring of dart graphs

DOI10.1007/978-3-642-19222-7_9MaRDI QIDQ3000496zbMATH OpenOpenAlexFDO

Authors 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) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Recommendations

• Brooks' theorem for generalized dart graphs
• Distance Coloring
• The complexity of colouring problems on dense graphs
• On Distance Coloring
• From graph coloring to constraint satisfaction: there and back again

Cites work

• scientific article; zbMATH DE number 1833071 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
• Some simplified NP-complete graph problems
• The 3-Colorability Problem on Graphs with Maximum Degree Four
• Three short proofs in graph theory
• Δ-List Vertex Coloring in Linear Time

Cited in

(1)

• Brooks' theorem for generalized dart graphs

This page was built for publication: Dichotomy for coloring of dart graphs

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