Completing small partial triple systems
From MaRDI portal
Publication:1053018
DOI10.1016/0012-365X(83)90033-XzbMath0517.05011MaRDI QIDQ1053018
Charles J. Colbourn, Alexander Rosa, Marlene J. Colbourn
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Simple neighbourhoods in triple systems, Embedding partial Steiner triple systems is NP-complete, Quadratic leaves of maximal partial triple systems, Element neighbourhoods in twofold triple systems, Embeddings of partial Steiner triple systems, Small Embeddings of Partial Steiner Triple Systems, A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
Cites Work
- Unnamed Item
- Embedding partial Steiner triple systems is NP-complete
- A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
- The completion of finite incomplete Steiner triple systems with applications to loop theory
- Every generalized Petersen graph has a Tait coloring
- On Cyclic Steiner 2-Designs
- Embedding Partial Steiner Triple Systems
- Maximal consistent families of triples