JOURNAL ARTICLE
Coloring Block Designs is NP-Complete
Charles J. ColbournMarlene J. ColbournKevin T. PhelpsVojtěch Rödl
Year: 1982 Journal: SIAM Journal on Algebraic and Discrete Methods Vol: 3 (3)Pages: 305-307 Publisher: Society for Industrial and Applied Mathematics
Abstract
Coloring partial Steiner triple systems is shown to be NP-complete. Together with an embedding technique of Lindner, this provides a short proof of the NP-completeness of coloring block designs.
Keywords:
Mathematics Combinatorics Block (permutation group theory) Embedding Completeness (order theory) Discrete mathematics Block size Computer science Artificial intelligence Key (lock)
Metrics
8
Cited By
1.37
FWCI (Field Weighted Citation Impact)
5
Refs
0.82
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
graph theory and CDMA systems
Physical Sciences → Engineering → Electrical and Electronic Engineering
Graph Labeling and Dimension Problems
Physical Sciences → Computer Science → Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Total coloring of snarks is NP-complete
Vinícius F. dos SantosDiana Sasaki
Journal: Matemática Contemporânea Year: 2015 Vol: 44 (6)
BOOK-CHAPTER
Complete Block Designs
Angela DeanDaniel VossDanel Draguljić
Springer texts in statistics Year: 2017 Pages: 305-347