Edge-coloring of 3-uniform hypergraphs
type: Item
instance of: scholarly article
title: Edge-coloring of 3-uniform hypergraphs
zbMATH Open document ID: 1351.05087
author: Paweł Obszarski
author: Andrzej Jastrzȩbski
published in: Discrete Applied Mathematics
publication date: 2016-12-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6668150
zbMATH Keywords: edge coloring
zbMATH Keywords: 3-uniform hypergraph
zbMATH Keywords: scheduling
MaRDI profile type: Publication
full work available at URL: j.dam.2016.06.009
OpenAlex ID: W2493458272
cites work: Q3983098
cites work: Graph Classes: A Survey
cites work: Q5782525
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: NP completeness of the edge precoloring extension problem on bipartite graphs
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: The NP-Completeness of Edge-Coloring
cites work: Q4832864
cites work: Asymptotic behavior of the chromatic index for hypergraphs
cites work: An \(0(n^{1.5})\) algorithm to color proper circular arcs
cites work: An O(qn) algorithm to q-color a proper family of circular arcs
DOI: 10.1016/J.DAM.2016.06.009
description: scientific article; zbMATH DE number 6668150