The square of a block is strongly path connected
From MaRDI portal
Publication:1844686
DOI10.1016/0095-8956(76)90065-4zbMath0284.05116OpenAlexW2045633145MaRDI QIDQ1844686
Richard H. Schelp, Ralph J. Faudree
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)90065-4
Related Items (8)
Connected even factors in the square of essentially 2-edge-connected graph ⋮ Graphs with cyclomatic number three having panconnected square ⋮ Unnamed Item ⋮ Completely strong path-connected tournaments ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Graphs with cyclomatic number two having panconnected square ⋮ Some recent results in hamiltonian graphs ⋮ On graphs whose square have strong Hamiltonian properties
Cites Work
- Unnamed Item
- A necessary condition for the square of a graph to be Hamiltonian
- The square of a block is vertex pancyclic
- The square of a block is Hamiltonian connected
- On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
- The square of every two-connected graph is Hamiltonian
- Minimally 2-connected graphs.
This page was built for publication: The square of a block is strongly path connected
