Approximating maximum edge 2-coloring by normalizing graphs
From MaRDI portal
Cites work
- 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?)
- An anti-Ramsey theorem on cycles
- Anti-Ramsey colorings in several rounds
- Approximation Algorithms for Maximum Edge Coloring Problem
- Approximation algorithm for maximum edge coloring
- 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
- Improved approximation for maximum edge colouring problem
- Maximum edge colouring problem on graphs that exclude a fixed minor
- 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 Q6986820)
