Embedding partial steiner triple systems is NP-complete
- 31 July 1983
- journal article
- Published by Elsevier BV in Journal of Combinatorial Theory, Series A
- Vol. 35 (1), 100-105
- https://doi.org/10.1016/0097-3165(83)90031-6
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Completing small partial triple systemsDiscrete Mathematics, 1983
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- Embedding Partial Steiner Triple SystemsProceedings of the London Mathematical Society, 1980
- A Survey of Embedding Theorems for Steiner SystemsPublished by Elsevier BV ,1980
- On embedding incomplete symmetric latin squaresJournal of Combinatorial Theory, Series A, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- The completion of finite incomplete Steiner triple systems with applications to loop theoryJournal of Combinatorial Theory, Series A, 1971
- Systems of Distinct RepresentativesThe American Mathematical Monthly, 1953