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)
Related Items
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 ⋮ Element neighbourhoods in twofold triple systems ⋮ The strong chromatic number of partial triple systems ⋮ Neighborhoods in Maximum Packings of 2Knand Quadratic Leaves of Triple Systems ⋮ Forest leaves and four-cycles ⋮ Group divisible designs with two associate classes, and quadratic leaves of triple systems ⋮ Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses ⋮ \(f\)-vectors of pure complexes and pure multicomplexes of rank three ⋮ Unnamed Item ⋮ The size of 3-uniform hypergraphs with given matching number and codegree ⋮ All graphs with maximum degree three whose complements have 4-cycle decompositions ⋮ Grooming for two-period optical networks ⋮ On a class of completable partial edge-colourings ⋮ 4-cycle systems of \(K_n-E(F^\ast)\) ⋮ A class of partial triple systems with applications in survey sampling ⋮ Nesting partial Steiner triple systems with 2-regular leave graphs ⋮ Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs ⋮ A survey of Skolem-type sequences and Rosa’s use of them ⋮ A decomposition of (λK υ)+ with extended triangles ⋮ Well-Balanced Designs for Data Placement ⋮ The spectrum of maximal partial Steiner triple systems ⋮ Simple neighbourhoods in triple systems ⋮ A solution to the forest leave problem for partial 6-cycle systems ⋮ Directed 3-cycle decompositions of complete directed graphs with quadratic leaves ⋮ The spectrum of cyclic BSEC with block size three ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quadratic leaves of maximal partial triple systems
