Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
type: Item
instance of: scholarly article
title: Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
zbMATH Open document ID: 1208.05028
author: Martin Kochol
published in: Discrete Applied Mathematics
publication date: 2010-11-05T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5810816
zbMATH Keywords: edge-coloring
zbMATH Keywords: orientable surface
zbMATH Keywords: polyhedral embedding
zbMATH Keywords: NP-complete problem
zbMATH Keywords: approximation algorithms
zbMATH Keywords: cyclical edge-connectivity
MaRDI profile type: Publication
full work available at URL: j.dam.2010.06.019
OpenAlex ID: W2013427304
cites work: Every Planar Map is Four Colorable
cites work: Handbook of Graph Theory
cites work: Q5315023
cites work: Q4198056
cites work: Q3757929
cites work: Q5587076
cites work: The NP-Completeness of Edge-Coloring
cites work: 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
cites work: Polyhedral embeddings of snarks in orientable surfaces
cites work: Superposition and constructions of graphs without nowhere-zero \(k\)-flows
cites work: Edge-coloring of multigraphs
cites work: Complexity of approximation of 3-edge-coloring of graphs
cites work: Graphs on surfaces
DOI: 10.1016/J.DAM.2010.06.019
description: scientific article; zbMATH DE number 5810816