Approximating maximum edge 2-coloring in simple graphs
From MaRDI portal
Publication:608271
DOI10.1016/j.dam.2010.08.010zbMath1216.05029MaRDI QIDQ608271
Sayuri Konno, Zhi-Zhong Chen, Yuki Matsushita
Publication date: 25 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.010
Related Items
Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture, Online edge coloring of paths and trees with a fixed number of colors, Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings, Online Dual Edge Coloring of Paths and Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- Algorithmic aspects in information and management. Third international conference, AAIM 2007, Portland, OR, USA, June 6--8, 2007. Proceedings.
- Packing \([1, \Delta \)-factors in graphs of small degree]
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
- Path factors in cubic graphs
- Complexity of Recognizing Equal Unions in Families of Sets