Cycle Extensions in BIBD Block-Intersection Graphs

DOI10.1002/jcd.21328zbMath1269.05064OpenAlexW1948972712MaRDI QIDQ2842262

Atif A. Abueida, David A. Pike

Publication date: 13 August 2013

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21328

zbMATH Keywords

intersection graphpolynomial time algorithmblock designcycle extension

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ Edge-transitive graphs and combinatorial designs

Cites Work

• Unnamed Item
• Unnamed Item
• Extending cycles in graphs
• Edge-pancyclic block-intersection graphs
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• Planar Hamiltonian chordal graphs are cycle extendable
• Pancyclic BIBD block-intersection graphs
• A note on Hamiltonian circuits
• Maximal Flow Through a Network
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• On Representatives of Subsets
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Cycle Extendability of Hamiltonian Interval Graphs

This page was built for publication: Cycle Extensions in BIBD Block-Intersection Graphs