Randomized Δ-edge colouring via exchanges of complex colours

DOI10.1080/00207160.2012.726712MaRDI QIDQ2868167zbMATH OpenOpenAlexFDO

Authors Tony T. Lee, Yujie Wan, Hao Guan

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

colour exchangeedge colouringincidence graphKempe path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The complexity of an exotic edge coloring of graphs
• Edge-colouring random graphs
• Randomized algorithms for colourings of hypergraphs
• Randomly colouring graphs (a combinatorial view)
• scientific article; zbMATH DE number 1984543
• Randomly colorable graphs in greedy coloring
• scientific article; zbMATH DE number 1962838
• A randomized algorithm for \(k\)-colorability
• Random I‐colorable graphs
• Colouring random graphs

Cites work

• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Generating Random Regular Graphs Quickly
• scientific article; zbMATH DE number 1881995 (Why is no real title available?)
• Near-optimal, distributed edge colouring via the nibble method
• The four-colour theorem
• The NP-Completeness of Edge-Coloring

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

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