Graph factorization, general triple systems, and cyclic triple systems
From MaRDI portal
(Redirected from Publication:1155058)
Combinatorial aspects of block designs (05B05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Steiner systems in finite geometry (51E10)
Cites work
Cited in
(13)- Row-column directed block designs
- Balanced ternary designs with block size three, any and any R
- The existence of near-Skolem and hooked near-Skolem sequences
- Starter sequences and \(M\)-fold starter sequences: how can you begin?
- Triples, current graphs and biembeddings
- On a conjecture about \((m_1,m_2)\)-near-Skolem sequences
- Generalizations of results of Stanton on BIBDs
- Totally symmetric Latin squares with prescribed intersection numbers
- The spectrum for three-times repeated blocks in an \(S_ 3(2,3,v)\)
- Graph factors and factorization: 1985--2003: a survey
- More balanced ternary designs with block size three
- Indecomposable \(S_ 6(2,3,v)'s\)
- A family of balanced ternary designs with block size four
This page was built for publication: Graph factorization, general triple systems, and cyclic triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155058)