Cycles in the block-intersection graph of pairwise balanced designs

DOI10.1016/0012-365X(93)E0140-YzbMath0813.05041WikidataQ127976873 ScholiaQ127976873MaRDI QIDQ1343785

Donovan R. Hare

Publication date: 6 February 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

pairwise balanced designblock designblock-intersection graphedge- pancyclic

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38)

Related Items (10)

Pancyclic BIBD block-intersection graphs ⋮ Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Silver block intersection graphs of Steiner 2-designs ⋮ Hamilton cycles in restricted block-intersection graphs ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ Pancyclic PBD block-intersection graphs ⋮ The connectivity of the block-intersection graphs of designs ⋮ The set of values of \(b\) for which there exist block designs with \(b\) blocks ⋮ Hamiltonicity and restricted block-intersection graphs of \(t\)-designs ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences

Cites Work

• Edge-pancyclic block-intersection graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles in the block-intersection graph of pairwise balanced designs