Randomly Colouring Graphs with Girth Five and Large Maximum Degree

DOI10.1007/11682462_61MaRDI QIDQ3525799zbMATH OpenOpenAlexFDO

Authors

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_61

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial probability (60C05)

Recommendations

• Randomly coloring graphs of girth at least five
• The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
• Randomly coloring constant degree graphs
• Randomly coloring graphs with lower bounds on girth and maximum degree

Cited in

(5)

• Spectral independence, coupling, and the spectral gap of the Glauber dynamics
• Local uniformity properties for Glauber dynamics on graph colorings
• Randomly coloring constant degree graphs
• Randomly coloring graphs of girth at least five
• Randomly coloring graphs with lower bounds on girth and maximum degree

This page was built for publication: Randomly Colouring Graphs with Girth Five and Large Maximum Degree

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