Approximation and Hardness Results for the Maximum Edge q-coloring Problem
From MaRDI portal
Publication:3060768
DOI10.1007/978-3-642-17514-5_12zbMath1310.68087OpenAlexW72216225WikidataQ58203690 ScholiaQ58203690MaRDI QIDQ3060768
Alexandru Popa, Anna Adamaszek
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_12
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 (3)
Improved approximation for maximum edge colouring problem ⋮ Approximation and hardness results for the maximum edge \(q\)-coloring problem ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths.
This page was built for publication: Approximation and Hardness Results for the Maximum Edge q-coloring Problem
