Pancyclic BIBD block-intersection graphs
From MaRDI portal
Publication:1876690
DOI10.1016/j.disc.2003.11.033zbMath1044.05021OpenAlexW2001705063MaRDI QIDQ1876690
Aygul Mamut, David A. Pike, Michael E. Raines
Publication date: 20 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.033
Related Items (10)
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 ⋮ Twofold triple systems without 2-intersecting Gray codes ⋮ Edge-transitive graphs and combinatorial designs ⋮ Cycle Extensions in BIBD Block-Intersection Graphs ⋮ Hamiltonicity and restricted block-intersection graphs of \(t\)-designs ⋮ Cops and Robbers on Graphs Based on Designs
Cites Work
- Pancyclism in Chvátal-Erdős' graphs
- Edge-pancyclic block-intersection graphs
- Pancyclism and bipancyclism of Hamiltonian graphs
- Cycles in the block-intersection graph of pairwise balanced designs
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- A note on Hamiltonian circuits
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Weakly pancyclic graphs
- On Representatives of Subsets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pancyclic BIBD block-intersection graphs