Edge-pancyclic block-intersection graphs

From MaRDI portal
Publication:1183963

DOI10.1016/0012-365X(91)90417-ZzbMath0758.05010MaRDI QIDQ1183963

Brian Alspach, Donovan R. Hare

Publication date: 28 June 1992

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




Related Items (31)

Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphsPancyclic BIBD block-intersection graphsNode-pancyclicity and edge-pancyclicity of crossed cubesCycles in the block-intersection graph of pairwise balanced designsHamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designsCycles passing through prescribed edges in a hypercube with some faulty edgesEdge-pancyclicity and Hamiltonian laceability of the balanced hypercubesVertex-bipancyclicity of the generalized honeycomb toriEdge-bipancyclicity of star graphs under edge-fault tolerantSilver block intersection graphs of Steiner 2-designsBipanconnectivity of faulty hypercubes with minimum degreeEdge-pancyclicity and Hamiltonian connectivity of twisted cubesHamilton cycles in restricted block-intersection graphsThe vertex-pancyclicity of data center networksDecomposable twofold triple systems with non-Hamiltonian 2-block intersection graphsEmbedding of cycles in twisted cubes with edge-pancyclicThe bipanconnectivity and \(m\)-panconnectivity of the folded hypercubeThe \(m\)-pancycle-connectivity of a WK-recursive networkEdge-fault-tolerant pancyclicity of arrangement graphsPancyclic PBD block-intersection graphsTwofold triple systems without 2-intersecting Gray codesVarious cycles embedding in faulty balanced hypercubesThe bipanpositionable bipancyclic property of the hypercubeBipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubesEdge-pancyclicity of recursive circulantsCycle Extensions in BIBD Block-Intersection GraphsSurvey on path and cycle embedding in some networksEdge-fault-tolerant edge-bipancyclicity of hypercubesHamiltonicity and restricted block-intersection graphs of \(t\)-designsBrian Alspach and his work\(L(n)\) graphs are vertex-pancyclic and Hamilton-connected



Cites Work


This page was built for publication: Edge-pancyclic block-intersection graphs