Twofold triple systems without 2-intersecting Gray codes

DOI10.1007/s10623-016-0259-7zbMath1359.05013OpenAlexW2478399918MaRDI QIDQ521863

David A. Pike, Aras Erzurumluoğlu

Publication date: 12 April 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0259-7

zbMATH Keywords

triple systemsblock designsGray codesHamilton pathsblock-intersection graphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Triple systems (05B07) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

\(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\) ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordering block designs. Gray codes, universal cycles and configuration orderings
• Hamilton cycles in restricted block-intersection graphs
• Existentially closed BIBD block-intersection graphs
• Two-fold triple systems without repeated blocks
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• Edge-pancyclic block-intersection graphs
• On the existence of 2-designs S\(_2\)(2,3,v) without repeated blocks
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• Pancyclic BIBD block-intersection graphs
• Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
• Cycle Extensions in BIBD Block-Intersection Graphs
• Hamilton cycles in block-intersection graphs of triple systems
• Decompositions of complete graphs into triangles and Hamilton cycles

This page was built for publication: Twofold triple systems without 2-intersecting Gray codes