Why Almost All k-Colorable Graphs Are Easy

DOI10.1007/978-3-540-70918-3_11MaRDI QIDQ3590926zbMATH OpenOpenAlexFDO

Authors Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_11

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Why almost all \(k\)-colorable graphs are easy to color
• Mathematical Foundations of Computer Science 2005
• Algorithms for Colouring Random k-colourable Graphs
• Almost all k-colorable graphs are easy to color
• Minimum Coloring k-Colorable Graphs in Polynomial Average Time

Cited in

(5)

• A Spectral Method for MAX2SAT in the Planted Solution Model
• Why almost all \(k\)-colorable graphs are easy to color
• Complexity of coloring random graphs: an experimental study of the hardest region
• Almost all k-colorable graphs are easy to color
• The forgetfulness of balls and bins

This page was built for publication: Why Almost All k-Colorable Graphs Are Easy

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