Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors

DOI10.1007/978-3-642-35261-4_6zbMATH Open1260.05061OpenAlexW172109902MaRDI QIDQ4909519

Hsueh-I Lu, Ching-Chen Kuo

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

Markov chainGlauber dynamicsmixing timegraph colorings

Mathematics Subject Classification ID

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

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Coloring complete and complete bipartite graphs from random lists 👍 👎
• A note on randomly colored matchings in random bipartite graphs 👍 👎
• Randomly coloring random graphs 👍 👎
• Coloring complete bipartite graphs from random lists 👍 👎
• Colouring Random Regular Graphs 👍 👎
• Randomly coloring graphs with lower bounds on girth and maximum degree 👍 👎
• Coloring Random and Semi-Random k-Colorable Graphs 👍 👎

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