Graphs with 1-hamiltonian-connected cubes
From MaRDI portal
Publication:2553448
DOI10.1016/0095-8956(73)90058-0zbMath0239.05128OpenAlexW2039856093MaRDI QIDQ2553448
Publication date: 1973
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(73)90058-0
Related Items (8)
Unnamed Item ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Disjoint path covers in cubes of connected graphs ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ 2-edge-Hamiltonian-connectedness of 4-connected plane graphs ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Euclidean bottleneck bounded-degree spanning tree ratios
Cites Work
- Unnamed Item
- Nonhamiltonian connected graphs
- On a certain ordering of the vertices of a tree
- On the Cube of a Graph
- The cube of every connected graph is 1-hamiltonian
- n-Hamiltonian graphs
- Trees with Hamiltonian square
- The square of every nonseparable graph is Hamiltonian
- The powers of a connected graph are highly hamiltonian
- Some Hamiltonian results in powers of graphs
This page was built for publication: Graphs with 1-hamiltonian-connected cubes
