TS(v, ) with cyclic 2-intersecting Gray codes: v 0 or 412
DOI10.1007/S00373-019-02107-1zbMATH Open1439.05036arXiv1805.00535OpenAlexW3009635906WikidataQ126318755 ScholiaQ126318755MaRDI QIDQ2175776FDOQ2175776
Melissa S. Keranen, John Asplund
Publication date: 30 April 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.00535
Recommendations
- Twofold triple systems with cyclic 2‐intersecting Gray codes
- Twofold triple systems without 2-intersecting Gray codes
- Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
- scientific article; zbMATH DE number 3882437
- Hamilton cycles in block-intersection graphs of triple systems
Combinatorial aspects of block designs (05B05) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Theory of error-correcting codes and error-detecting codes (94B99) Triple systems (05B07)
Cites Work
- Title not available (Why is that?)
- A Survey of Combinatorial Gray Codes
- Title not available (Why is that?)
- Hamilton cycles in block-intersection graphs of triple systems
- On the existence of 2-designs Slambda(2,3,v) without repeated blocks
- Some balanced complete block designs
- Ordering block designs. Gray codes, universal cycles and configuration orderings
- Title not available (Why is that?)
- Twofold triple systems without 2-intersecting Gray codes
- Hamiltonian cycles in the cartesian product of a tree and a cycle
- Twofold triple systems with cyclic 2‐intersecting Gray codes
Cited In (1)
This page was built for publication: \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175776)