Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities

DOI10.1007/11821069_18MaRDI QIDQ5756687zbMATH OpenOpenAlexFDO

Authors Ulrik Brandes, Jürgen Lerner

Publication date 5 September 2007

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

Full work available at URL http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-73392

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• A spectral technique for coloring random 3-colorable graphs (preliminary version)
• Coloring random graphs
• A Spectral Technique for Coloring Random 3-Colorable Graphs
• Why almost all k-colorable graphs are easy to color
• Mathematical Foundations of Computer Science 2005

Cited in

(5)

• A spectral technique for coloring random 3-colorable graphs (preliminary version)
• Structural similarity: spectral methods for relaxed blockmodeling
• Group-Level Analysis and Visualization of Social Networks
• A Spectral Technique for Coloring Random 3-Colorable Graphs
• On the effect of randomness on planted 3-coloring models

This page was built for publication: Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities

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