Cycle extensions in BIBD block-intersection graphs
From MaRDI portal
Recommendations
- Cycle extensions in PBD block-intersection graphs.
- Cycles in the block-intersection graph of pairwise balanced designs
- Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
- Existentially closed BIBD block-intersection graphs
- Pancyclic BIBD block-intersection graphs
Cites work
- A note on Hamiltonian circuits
- Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
- Cycle Extendability of Hamiltonian Interval Graphs
- Edge-pancyclic block-intersection graphs
- Extending cycles in graphs
- scientific article; zbMATH DE number 431053 (Why is no real title available?)
- scientific article; zbMATH DE number 3779369 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Maximal Flow Through a Network
- On Representatives of Subsets
- Optimal and pessimal orderings of Steiner triple systems in disk arrays.
- Pancyclic BIBD block-intersection graphs
- Planar Hamiltonian chordal graphs are cycle extendable
Cited in
(9)- Bicyclic extensions
- Pancyclic BIBD block-intersection graphs
- Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
- Edge-transitive graphs and combinatorial designs
- Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
- Cycle extensions in PBD block-intersection graphs.
- Twofold triple systems without 2-intersecting Gray codes
- Mutual incidence matrix of two balanced incomplete block designs
- Spanning Euler tours in hypergraphs
This page was built for publication: Cycle extensions in BIBD block-intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842262)
