Quadratic leaves of maximal partial triple systems
From MaRDI portal
Publication:1086567
DOI10.1007/BF01788106zbMath0609.05009MaRDI QIDQ1086567
Charles J. Colbourn, Alexander Rosa
Publication date: 1986
Published in: Graphs and Combinatorics (Search for Journal in Brave)
05B05: Combinatorial aspects of block designs
Related Items
A class of partial triple systems with applications in survey sampling, Unnamed Item, Simple neighbourhoods in triple systems, Element neighbourhoods in twofold triple systems, The strong chromatic number of partial triple systems, On a class of completable partial edge-colourings, Nesting partial Steiner triple systems with 2-regular leave graphs, The spectrum of maximal partial Steiner triple systems, A solution to the forest leave problem for partial 6-cycle systems, Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves, Decomposing \(K_{n} \cup P\) into triangles, Embeddings of maximum packings in triple systems, The spectrum of cyclic BSEC with block size three, Unnamed Item, Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding partial Steiner triple systems is NP-complete
- Langford sequences: Perfect and hooked
- Completing small partial triple systems
- Element neighbourhoods in twofold triple systems
- The strong chromatic number of partial triple systems
- Every generalized Petersen graph has a Tait coloring
- On Cyclic Steiner 2-Designs
- Embedding Partial Steiner Triple Systems
- Maximal consistent families of triples
