Approximating maximum edge 2-coloring by normalizing graphs
From MaRDI portal
Publication:6574923
DOI10.1007/978-3-031-49815-2_3MaRDI QIDQ6574923FDOQ6574923
Authors: Tobias Mömke, Alexandru N. Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze 
Publication date: 19 July 2024
Cites Work
- Polychromatic Hamilton cycles
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem on cycles
- Bipartite anti-Ramsey numbers of cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- The anti-Ramsey number of perfect matching
- Graphs with 1-Factors
- Approximation algorithm for maximum edge coloring
- The min-max edge \(q\)-coloring problem
- Approximation and hardness results for the maximum edge \(q\)-coloring problem
- Approximation Algorithms for Maximum Edge Coloring Problem
- Title not available (Why is that?)
- Complete solution for the rainbow numbers of matchings
- Anti-Ramsey colorings in several rounds
- The theory of regular graphs
- Heuristic algorithms for the min-max edge 2-coloring problem
- Improved approximation for maximum edge colouring problem
This page was built for publication: Approximating maximum edge 2-coloring by normalizing graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574923)
