The Min-max Edge q-Coloring Problem

DOI10.1007/978-3-319-19315-1_20zbMath1401.05121arXiv1302.3404OpenAlexW1582433610MaRDI QIDQ2946058

Alexandru Popa, Tommi Larjomaa

Publication date: 15 September 2015

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Approximation and hardness results for the maximum edge \(q\)-coloring problem ⋮ Edge $k$-$q$-Colorability of Graphs

This page was built for publication: The Min-max Edge q-Coloring Problem