Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex

DOI10.1016/S0012-365X(97)00220-3MaRDI QIDQ1584311zbMATH OpenOpenAlexFDO

Authors George R. T. Hendry, C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(97)00220-3

zbMATH Keywords

Hamiltonian pathHamiltonian-connected

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Graphs uniquely Hamiltonian-connected from a vertex
• The size of graphs uniquely Hamiltonian-connected from a vertex
• On the structure of graphs uniquely hamiltonian-connected from a vertex
• scientific article; zbMATH DE number 867696
• A degree constraint for uniquely Hamiltonian graphs

Cites work

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

Cited in

(9)

• Vertices of small degree in uniquely Hamiltonian graphs
• On the structure of graphs uniquely hamiltonian-connected from a vertex
• Uniquely Hamiltonian graphs of minimum degree 4
• A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS
• Maximum graphs non-Hamiltonian-connected from a vertex
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• scientific article; zbMATH DE number 867696 (Why is no real title available?)
• Graphs uniquely Hamiltonian-connected from a vertex
• A degree constraint for uniquely Hamiltonian graphs

This page was built for publication: Forbidden subgraphs of 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 Q1584311)