Journal of Combinatorial Designs · 1999 · 17 citations · 3 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComplex SystemsDynamical SystemsDirected Acyclic GraphsGraph AlgorithmsGraph TheoryHamiltonian SystemsHamiltonian CyclesHamiltonian GraphsIntersection Graphs
Given a BIBD S = (V, B), its 1-block-intersection graph Gs has as vertices the elements of B; two vertices B1, B2 ∈ B are adjacent in Gs if |B1 ∩ B2| = 1. If S is a triple system of arbitrary index λ, it is shown that GS is hamiltonian. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 243-246, 1999
3
A note on Hamiltonian circuits
Vašek Chvátal, P. Erdös · Discrete Mathematics · 1972 · 629 citations
Edge-pancyclic block-intersection graphs
Brian Alspach, Donovan R. Hare · Discrete Mathematics · 1991 · 47 citations