Quadratic leaves of maximal partial triple systems
From MaRDI portal
(Redirected from Publication:1086567)
Cites work
- scientific article; zbMATH DE number 3981181 (Why is no real title available?)
- scientific article; zbMATH DE number 3710185 (Why is no real title available?)
- scientific article; zbMATH DE number 3788634 (Why is no real title available?)
- scientific article; zbMATH DE number 3428981 (Why is no real title available?)
- Completing small partial triple systems
- Element neighbourhoods in twofold triple systems
- Embedding Partial Steiner Triple Systems
- Embedding partial Steiner triple systems is NP-complete
- Every generalized Petersen graph has a Tait coloring
- Langford sequences: Perfect and hooked
- Maximal consistent families of triples
- On Cyclic Steiner 2-Designs
- The strong chromatic number of partial triple systems
Cited in
(34)- A solution to the forest leave problem for partial 6-cycle systems
- Cubic leaves
- f-vectors of pure complexes and pure multicomplexes of rank three
- Embeddings of maximum packings in triple systems
- The spectrum of maximal partial Steiner triple systems
- Element neighbourhoods in twofold triple systems
- Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves
- scientific article; zbMATH DE number 4053628 (Why is no real title available?)
- Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
- Neighborhoods in maximum packings of \(2K_n\) and quadratic leaves of triple systems
- Well-balanced designs for data placement
- scientific article; zbMATH DE number 89393 (Why is no real title available?)
- The size of 3-uniform hypergraphs with given matching number and codegree
- scientific article; zbMATH DE number 4041928 (Why is no real title available?)
- scientific article; zbMATH DE number 4041929 (Why is no real title available?)
- Decomposing graphs of high minimum degree into 4-cycles
- The spectrum of cyclic BSEC with block size three
- Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
- Block size five: quo vadis?
- Generating sets in Steiner triple systems
- Simple neighbourhoods in triple systems
- A decomposition of (λK υ)+ with extended triangles
- Forest leaves and four-cycles
- Decomposing \(K_{n} \cup P\) into triangles
- Grooming for two-period optical networks
- Directed 3-cycle decompositions of complete directed graphs with quadratic leaves
- The strong chromatic number of partial triple systems
- On a class of completable partial edge-colourings
- A class of partial triple systems with applications in survey sampling
- 4-cycle systems of \(K_n-E(F^\ast)\)
- Nesting partial Steiner triple systems with 2-regular leave graphs
- All graphs with maximum degree three whose complements have 4-cycle decompositions
- A survey of Skolem-type sequences and Rosa’s use of them
- Group divisible designs with two associate classes, and quadratic leaves of triple systems
This page was built for publication: Quadratic leaves of maximal partial triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086567)
