Quadratic leaves of maximal partial triple systems

DOI10.1007/BF01788106zbMath0609.05009MaRDI QIDQ1086567

Charles J. Colbourn, Alexander Rosa

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Langford sequences; maximal partial triple system

Mathematics Subject Classification ID

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, All graphs with maximum degree three whose complements have 4-cycle decompositions, 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, Grooming for two-period optical networks, A survey of Skolem-type sequences and Rosa’s use of them, A decomposition of (λK υ)+ with extended triangles

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