On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
type: Item
instance of: scholarly article
title: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
zbMATH Open document ID: 0535.68030
DOI: 10.1007/BF02579160
author: Kevin T. Phelps
author: Vojtěch Rödl
published in: Combinatorica
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05B07
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 51E10
zbMATH DE Number: 3850482
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: hypergraph coloring
zbMATH Keywords: Steiner systems
MaRDI profile type: Publication
cites work: Colouring Steiner quadruple systems
cites work: On embedding incomplete symmetric Latin squares
cites work: On chromatic number of graphs and set-systems
cites work: Endliche Vervollständigung endlicher partieller Steinerscher Systeme. (Finite completion of finite partial Steiner systems)
cites work: Finite partial quadruple systems can be finitely embedded
cites work: The Complexity of Near-Optimal Graph Coloring
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Combinatorial optimization. Networks and matroids
cites work: A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
cites work: A Survey of Embedding Theorems for Steiner Systems
cites work: Q4083461
cites work: Near vector spaces over GF(q) and (v,q + 1,1) BIBDs
cites work: The completion of finite incomplete Steiner triple systems with applications to loop theory
cites work: Coloring Block Designs is NP-Complete
full work available at URL: https://doi.org/10.1007/bf02579160
OpenAlex ID: W2049432567
Recommended article: On colourings of Steiner triple systems
Recommended article: Strict colouring for classes of Steiner triple systems
Recommended article: Q4457006
Recommended article: Greedy Colourings of Steiner Triple Systems
Recommended article: Strict colorings of Steiner triple and quadruple systems: A survey
Recommended article: Colouring of cubic graphs by Steiner triple systems
Recommended article: Q4982431
Recommended article: Q4244117
Recommended article: Improved algorithms for colorings of simple hypergraphs and applications
Recommended article: Q3223450
description: scientific article; zbMATH DE number 3850482