Complexity of approximation of 3-edge-coloring of graphs
type: Item
instance of: scholarly article
title: Complexity of approximation of 3-edge-coloring of graphs
zbMATH Open document ID: 1191.68468
author: Martin Kochol
author: Nad'a Krivoňáková
author: Silvia Smejová
author: Katarína Šranková
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5719189
zbMATH Keywords: edge-coloring of graphs
zbMATH Keywords: NP-completeness
zbMATH Keywords: approximation algorithms
zbMATH Keywords: cyclical edge-connectivity
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.05.015
OpenAlex ID: W2004299695
cites work: Q4198056
cites work: The NP-Completeness of Edge-Coloring
cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
cites work: A cyclically 6-edge-connected snark of order 118
cites work: Superposition and constructions of graphs without nowhere-zero \(k\)-flows
cites work: Experimental and Efficient Algorithms
DOI: 10.1016/J.IPL.2008.05.015
description: scientific article; zbMATH DE number 5719189