Dichotomy for coloring of dart graphs

DOI10.1007/978-3-642-19222-7_9zbMATH Open1326.05046OpenAlexW1568703699MaRDI QIDQ3000496FDOQ3000496

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Some simplified NP-complete graph problems
• Three short proofs in graph theory
• The 3-Colorability Problem on Graphs with Maximum Degree Four
• Title not available (Why is that?)
• A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
• Δ-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)