Why Almost All k-Colorable Graphs Are Easy
From MaRDI portal
Publication:3590926
DOI10.1007/978-3-540-70918-3_11zbMath1186.05050OpenAlexW2161257095MaRDI QIDQ3590926
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
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items