Graphs with 1-hamiltonian-connected cubes

DOI10.1016/0095-8956(73)90058-0MaRDI QIDQ2553448zbMATH OpenOpenAlexFDO

Authors Linda Lesniak

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05Cxx)

Cites work

• scientific article; zbMATH DE number 3192675 (Why is no real title available?)
• n-Hamiltonian graphs
• Nonhamiltonian connected graphs
• On a certain ordering of the vertices of a tree
• On the Cube of a Graph
• Some Hamiltonian results in powers of graphs
• The cube of every connected graph is 1-hamiltonian
• The powers of a connected graph are highly hamiltonian
• The square of every nonseparable graph is Hamiltonian
• Trees with Hamiltonian square

Cited in

(8)

• Euclidean bottleneck bounded-degree spanning tree ratios
• Single-source three-disjoint path covers in cubes of connected graphs
• Disjoint path covers in cubes of connected graphs
• 2-edge-Hamiltonian-connectedness of 4-connected plane 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
• scientific article; zbMATH DE number 7662164 (Why is no real title available?)
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph

This page was built for publication: Graphs with 1-hamiltonian-connected cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553448)