Hamilton cycles in block-intersection graphs of triple systems

DOI<243::AID-JCD2>3.0.CO;2-A 10.1002/(SICI)1520-6610(1999)7:4<243::AID-JCD2>3.0.CO;2-AzbMath0934.05024OpenAlexW2008461399MaRDI QIDQ4266928

David A. Pike, Peter Horák, Michael E. Raines

Publication date: 10 April 2000

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1999)7:4<243::aid-jcd2>3.0.co;2-a

zbMATH Keywords

triple systemHamilton cycles1-block-intersection graph

Mathematics Subject Classification ID

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

Related Items (9)

Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Silver block intersection graphs of Steiner 2-designs ⋮ \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\) ⋮ Hamilton cycles in restricted block-intersection graphs ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ Pancyclic PBD block-intersection graphs ⋮ Twofold triple systems without 2-intersecting Gray codes ⋮ Hamiltonicity and restricted block-intersection graphs of \(t\)-designs ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences

This page was built for publication: Hamilton cycles in block-intersection graphs of triple systems