On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

DOI10.1007/978-3-642-40313-2_44zbMath1398.68239arXiv1306.2931OpenAlexW1888074460MaRDI QIDQ2849937

Prachi Goyal, Neeldhara Misra, Vikram Kamat

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Improved approximation for maximum edge colouring problem ⋮ Approximation and hardness results for the maximum edge \(q\)-coloring problem

This page was built for publication: On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem