Randomized Δ-edge colouring via exchanges of complex colours

DOI10.1080/00207160.2012.726712zbMath1278.05103OpenAlexW1995597112MaRDI QIDQ2868167

Tony T. Lee, Hao Guan, Yujie Wan

Publication date: 23 December 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.726712

zbMATH Keywords

edge colouringincidence graphKempe pathcolour exchange

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Near-optimal, distributed edge colouring via the nibble method
• The four-colour theorem
• The NP-Completeness of Edge-Coloring
• Generating Random Regular Graphs Quickly

This page was built for publication: Randomized Δ-edge colouring via exchanges of complex colours