Hamiltonicity and restricted block-intersection graphs of \(t\)-designs
From MaRDI portal
Publication:1045028
DOI10.1016/j.disc.2009.05.019zbMath1191.05022OpenAlexW2049216882MaRDI QIDQ1045028
David A. Pike, Robert C. Vandell, Matt Walsh
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.019
Combinatorial aspects of block designs (05B05) Eulerian and Hamiltonian graphs (05C45) Graph designs and isomorphic decomposition (05C51)
Related Items (3)
Hamilton cycles in restricted block-intersection graphs ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ Overlap Cycles for Steiner Quadruple Systems
Cites Work
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- Edge-pancyclic block-intersection graphs
- Cycles in the block-intersection graph of pairwise balanced designs
- Locally trivial t-designs and t-designs without repeated blocks
- Pancyclic BIBD block-intersection graphs
- Pancyclic PBD block-intersection graphs
- A note on Hamiltonian circuits
- Hamilton cycles in block-intersection graphs of triple systems
- Unnamed Item
- Unnamed Item
This page was built for publication: Hamiltonicity and restricted block-intersection graphs of \(t\)-designs