Twofold triple systems without 2-intersecting Gray codes

DOI10.1007/S10623-016-0259-7MaRDI QIDQ521863zbMATHOpenAlexFDO

Authors Aras Erzurumluoğlu, David A. Pike

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 systemsGray codesblock designsHamilton pathsblock-intersection graphs

Mathematics Subject Classification ID

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

Recommendations

• Twofold triple systems with cyclic 2‐intersecting Gray codes
• Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
• \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)
• scientific article; zbMATH DE number 3882437
• Hamilton cycles in block-intersection graphs of triple systems

Cites work

• scientific article; zbMATH DE number 431053 (Why is no real title available?)
• scientific article; zbMATH DE number 3882437 (Why is no real title available?)
• scientific article; zbMATH DE number 4160773 (Why is no real title available?)
• scientific article; zbMATH DE number 1556751 (Why is no real title available?)
• scientific article; zbMATH DE number 3097788 (Why is no real title available?)
• Cycle extensions in BIBD block-intersection graphs
• Decompositions of complete graphs into triangles and Hamilton cycles
• Design theory.
• Edge-pancyclic block-intersection graphs
• Existentially closed BIBD block-intersection graphs
• Hamilton cycles in block-intersection graphs of triple systems
• Hamilton cycles in restricted block-intersection graphs
• Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
• On the existence of 2-designs S\(_2\)(2,3,v) without repeated blocks
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• Ordering block designs. Gray codes, universal cycles and configuration orderings
• Pancyclic BIBD block-intersection graphs
• Two-fold triple systems without repeated blocks

Cited in

(4)

• scientific article; zbMATH DE number 3882437 (Why is no real title available?)
• Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
• \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)
• Twofold triple systems with cyclic 2‐intersecting Gray codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521863)