Improved Edge-Coloring with Three Colors

DOI10.1007/11917496_9MaRDI QIDQ3522945zbMATH OpenOpenAlexFDO

Authors Łukasz Kowalik

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11917496_9

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Improved edge-coloring with three colors
• A better than “best possible” algorithm to edge color multigraphs
• An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
• Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction.
• Colorings with few colors: counting, enumeration and combinatorial bounds

Cited in

(6)

• Approximating the maximum 3-edge-colorable subgraph problem
• A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
• 3-coloring in time
• Tight lower bounds for list edge coloring
• On the partition of 3-colorable graphs
• Improved edge-coloring with three colors

This page was built for publication: Improved Edge-Coloring with Three Colors

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