Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors

DOI10.1007/978-3-642-35261-4_6MaRDI QIDQ4909519zbMATH OpenOpenAlexFDO

Authors Ching-Chen Kuo, Hsueh-I Lu

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_6

zbMATH Keywords

Glauber dynamicsgraph coloringsMarkov chainmixing time

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational methods in Markov chains (60J22) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Colouring Random Regular Graphs
• scientific article; zbMATH DE number 4072999
• Coloring complete bipartite graphs from random lists
• Coloring complete and complete bipartite graphs from random lists
• A note on randomly colored matchings in random bipartite graphs
• Randomly coloring graphs with lower bounds on girth and maximum degree
• Randomly colorable graphs in greedy coloring
• Coloring Random and Semi-Random k-Colorable Graphs
• Randomly coloring random graphs
• Colouring random graphs

This page was built for publication: Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors

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