Approximating the Maximum 3- and 4-Edge-Colorable Subgraph

DOI10.1007/978-3-642-13731-0_37zbMath1285.68213OpenAlexW1484228278MaRDI QIDQ3569908

Łukasz Kowalik, Marcin Kaminski

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_37

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Online Dual Edge Coloring of Paths and Trees

This page was built for publication: Approximating the Maximum 3- and 4-Edge-Colorable Subgraph