Approximating maximum edge 2-coloring in simple graphs
type: Item
instance of: scholarly article
title: Approximating maximum edge 2-coloring in simple graphs
zbMATH Open document ID: 1216.05029
author: Zhi-Zhong Chen
author: Sayuri Konno
author: Yuki Matsushita
published in: Discrete Applied Mathematics
publication date: 2010-11-25T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5819502
zbMATH Keywords: approximation algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: edge coloring
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: j.dam.2010.08.010
OpenAlex ID: W1979880971
cites work: Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
cites work: Algorithmic aspects in information and management. Third international conference, AAIM 2007, Portland, OR, USA, June 6--8, 2007. Proceedings.
cites work: Q4411281
cites work: Complexity of Recognizing Equal Unions in Families of Sets
cites work: Path factors in cubic graphs
cites work: Approximating the maximum 2- and 3-edge-colorable subgraph problems
cites work: Packing \([1, \Delta ]\)-factors in graphs of small degree
cites work: Q3799261
cites work: Q4945523
DOI: 10.1016/J.DAM.2010.08.010
description: scientific article; zbMATH DE number 5819502