Recommendations
Cites work
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 4006279 (Why is no real title available?)
- scientific article; zbMATH DE number 4059426 (Why is no real title available?)
- scientific article; zbMATH DE number 124517 (Why is no real title available?)
- scientific article; zbMATH DE number 124522 (Why is no real title available?)
- scientific article; zbMATH DE number 3485815 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- Asymptotic behavior of the chromatic index for hypergraphs
- Frames for Kirkman triple systems
- Greedy Colourings of Steiner Triple Systems
- On resolvable balanced incomplete block designs
- Steiner Systems and Room Squares
- The chromatic index of cyclic Steiner 2-designs
Cited in
(28)- f-vectors of pure complexes and pure multicomplexes of rank three
- Steiner triple systems with high chromatic index
- Hanani triple packings and optimal \(q\)-ary codes of constant weight three
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs
- On the chromatic index of path decompositions
- The chromatic index of projective triple systems
- Block colourings of star systems
- Trails of triples in partial triple systems
- Twofold 2-perfect bowtie systems with an extra property
- On the edge-coloring property for Hanani triple systems
- Zero-sum flows for triple systems
- Generalized packing designs
- Egalitarian Steiner triple systems for data popularity
- Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
- Weak and strong nestings of BIBDs
- Guest editorial: Special issue in honor of Scott A. Vanstone
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- Almost resolvable maximum packings of complete graphs with 5-cycles
- The Hamilton-Waterloo problem for triangle-factors and Hamiltonian cycles solved
- Some new Kirkman signal sets
- Graph and hypergraph colouring via nibble methods: a survey
- On the existence of cycle frames and almost resolvable cycle systems
- The generalized almost resolvable cycle system problem
- More results on cycle frames and almost resolvable cycle systems
- Steiner quadruple systems with minimum colorable derived designs: constructions and applications
- Almost resolvable duplicated Steiner triple systems
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
- Almost resolvable cycle systems --an analogue of Hanani triple systems
This page was built for publication: Hanani triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690071)
