The square of a block is vertex pancyclic
From MaRDI portal
Publication:1223431
DOI10.1016/0095-8956(76)90061-7zbMath0321.05135OpenAlexW2073097708MaRDI QIDQ1223431
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(76)90061-7
Related Items (22)
Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphs ⋮ Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes ⋮ Edge-bipancyclicity of star graphs under edge-fault tolerant ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ Unnamed Item ⋮ Edge-pancyclicity and Hamiltonian connectivity of twisted cubes ⋮ The vertex-pancyclicity of data center networks ⋮ The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ The \(m\)-pancycle-connectivity of a WK-recursive network ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Some recent results in hamiltonian graphs ⋮ A necessary condition for the square of a graph to be Hamiltonian ⋮ The bipanpositionable bipancyclic property of the hypercube ⋮ The entire graph of a bridgeless connected plane graph is Hamiltonian ⋮ In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts ⋮ Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes ⋮ Extending cycles in graphs ⋮ Survey on path and cycle embedding in some networks ⋮ On graphs whose square have strong Hamiltonian properties ⋮ Edge-fault-tolerant edge-bipancyclicity of hypercubes ⋮ The square of a block is strongly path connected
Cites Work
This page was built for publication: The square of a block is vertex pancyclic
