Approximating maximum edge 2-coloring by normalizing graphs

DOI10.1007/978-3-031-49815-2_3MaRDI QIDQ6574923zbMATH OpenFDO

Authors Tobias Mömke, Alexandru N. Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49815-2_3

zbMATH Keywords

approximation algorithmsedge 2-coloringmatchings

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites work

• An anti-Ramsey theorem on cycles
• Anti-Ramsey colorings in several rounds
• Approximation algorithm for maximum edge coloring
• Approximation Algorithms for Maximum Edge Coloring Problem
• Approximation and hardness results for the maximum edge q-coloring problem
• Bipartite anti-Ramsey numbers of cycles
• Complete solution for the rainbow numbers of matchings
• Edge-colorings of complete graphs that avoid polychromatic trees
• Edge-colorings with no large polychromatic stars
• Graphs with 1-Factors
• Heuristic algorithms for the min-max edge 2-coloring problem
• scientific article; zbMATH DE number 3492724 (Why is no real title available?)
• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• scientific article; zbMATH DE number 2192164 (Why is no real title available?)
• Improved approximation for maximum edge colouring problem
• Polychromatic Hamilton cycles
• Rainbow numbers for matchings and complete graphs
• The anti-Ramsey number of perfect matching
• The min-max edge \(q\)-coloring problem
• The theory of regular graphs

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)