Efficiently list-edge coloring multigraphs asymptotically optimally

DOI10.1137/1.9781611975994.142MaRDI QIDQ5146931zbMATH OpenOpenAlexFDO

Authors Fotis Iliopoulos, Alistair Sinclair

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.10309

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Efficiently list‐edge coloring multigraphs asymptotically optimally
• Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs
• Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
• An asymptotic approximation scheme for multigraph edge coloring
• An asymptotic approximation scheme for multigraph edge coloring
• List edge multicoloring in graphs with few cycles
• List edge and list total colourings of multigraphs
• Tight lower bounds for list edge coloring
• Near-optimal list colorings
• List edge-coloring and total coloring in graphs of low treewidth

Cited in

(3)

• Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
• Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
• Efficiently list‐edge coloring multigraphs asymptotically optimally

This page was built for publication: Efficiently list-edge coloring multigraphs asymptotically optimally

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