The strong chromatic number of partial triple systems
type: Item
instance of: scholarly article
title: The strong chromatic number of partial triple systems
zbMATH Open document ID: 0642.05022
DOI: 10.1016/0166-218X(88)90039-X
author: Charles J. Colbourn
author: Dieter Jungnickel
author: Alexander Rosa
published in: Discrete Applied Mathematics
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05B07
zbMATH DE Number: 4045771
zbMATH Keywords: strong colouring
zbMATH Keywords: hypergraph
zbMATH Keywords: algorithm
zbMATH Keywords: maximal partial triple systems
zbMATH Keywords: strong chromatic numbers
MaRDI profile type: Publication
cites work: Q3686719
cites work: Embedding partial Steiner triple systems is NP-complete
cites work: Q3728912
cites work: Coloring Block Designs is NP-Complete
cites work: Quadratic leaves of maximal partial triple systems
cites work: Q3728911
cites work: Coloring Steiner Triple Systems
cites work: Q4198056
cites work: The NP-Completeness of Edge-Coloring
cites work: Q3048571
cites work: NP completeness of finding the chromatic index of regular graphs
cites work: Q5181736
cites work: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
cites work: Q5680138
Recommended article: On the chromatic number of simple triangle-free triple systems
Recommended article: Q4244117
Recommended article: Partial triple systems and edge colourings
Recommended article: Strong total chromatic numbers of complete hypergraphs
Recommended article: On the Strong Chromatic Number
Recommended article: On the Strong Chromatic Number of Graphs
Recommended article: The strong chromatic number of a graph
Recommended article: The Chromatic Index of Projective Triple Systems
Recommended article: Q3990580
description: scientific article; zbMATH DE number 4045771