\(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)

DOI10.1007/s00373-019-02107-1zbMath1439.05036arXiv1805.00535OpenAlexW3009635906WikidataQ126318755 ScholiaQ126318755MaRDI QIDQ2175776

John Asplund, Melissa S. Keranen

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

zbMATH Keywords

triple systemHamilton cycleGray codesblock intersection graphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Triple systems (05B07) Theory of error-correcting codes and error-detecting codes (94B99) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs

Cites Work

• Ordering block designs. Gray codes, universal cycles and configuration orderings
• Twofold triple systems without 2-intersecting Gray codes
• Hamiltonian cycles in the cartesian product of a tree and a cycle
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• Some balanced complete block designs
• Hamilton cycles in block-intersection graphs of triple systems
• A Survey of Combinatorial Gray Codes
• Twofold triple systems with cyclic 2‐intersecting Gray codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)