Hamilton cycles in restricted block-intersection graphs

DOI10.1007/s10623-010-9483-8zbMath1229.05047OpenAlexW2005094977MaRDI QIDQ648070

Andrew T. Jesso, Nabil Shalaby, David A. Pike

Publication date: 22 November 2011

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

Full work available at URL: https://doi.org/10.1007/s10623-010-9483-8

zbMATH Keywords

block designsHamilton cyclesHamilton-connectedblock-intersection graphs

Mathematics Subject Classification ID

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

Related Items (3)

Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ Twofold triple systems without 2-intersecting Gray codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordering block designs. Gray codes, universal cycles and configuration orderings
• Hamiltonicity and restricted block-intersection graphs of \(t\)-designs
• Edge-pancyclic block-intersection graphs
• Single change covering designs
• Single-change circular covering designs
• Cycles in the block-intersection graph of pairwise balanced designs
• Pancyclic BIBD block-intersection graphs
• Pancyclic PBD block-intersection graphs
• A note on Hamiltonian circuits
• Hamilton cycles in block-intersection graphs of triple systems
• Some New Bounds on Single-Change Covering Designs
• Combinatorial Designs

This page was built for publication: Hamilton cycles in restricted block-intersection graphs