Graphs uniquely Hamiltonian-connected from a vertex

DOI10.1016/0012-365X(84)90151-1MaRDI QIDQ790840zbMATH OpenFDO

Authors George R. T. Hendry

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(84)90151-1

zbMATH Keywords

Hamiltonian connectedHamiltonian path

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex
• The size of graphs uniquely Hamiltonian-connected from a vertex
• Critical Hamiltonian connected graphs.
• scientific article; zbMATH DE number 867696
• On the structure of graphs uniquely hamiltonian-connected from a vertex

Cites work

• Hamilton connected graphs
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• scientific article; zbMATH DE number 3737725 (Why is no real title available?)
• scientific article; zbMATH DE number 3284075 (Why is no real title available?)
• Parallel concepts in graph theory

Cited in

(7)

• The size of graphs uniquely Hamiltonian-connected from a vertex
• The minimum size of graphs Hamiltonian-connected from a vertex
• The structure of transform graphs
• Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex
• On the structure of graphs uniquely hamiltonian-connected from a vertex
• Uniquely Hamiltonian graphs of minimum degree 4
• scientific article; zbMATH DE number 867696 (Why is no real title available?)

This page was built for publication: Graphs uniquely Hamiltonian-connected from a vertex

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