Graphs with many Hamiltonian paths

DOI10.2140/INVOLVE.2025.18.613MaRDI QIDQ6938092zbMATH OpenFDO

Authors Erik Carlson, Willem Fletcher, Murphykate Montee, Xingyi Zhang

Publication date 26 August 2025

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/INVOLVE.2025.18.613

zbMATH Keywords

HamiltonianHamiltonian-connectedpair-strung

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites work

• K₂‐Hamiltonian graphs: II
• Critical Hamiltonian connected graphs.
• Hamilton connected graphs
• Hamiltonian paths and hamiltonian connectivity in graphs
• Hamiltonian-connected graphs with large neighborhoods and degrees
• scientific article; zbMATH DE number 3937205 (Why is no real title available?)
• scientific article; zbMATH DE number 3754737 (Why is no real title available?)
• scientific article; zbMATH DE number 1409195 (Why is no real title available?)
• Neighbourhood unions and Hamiltonian properties in graphs
• On a Problem of Ore
• On hypohamiltonian and almost hypohamiltonian graphs
• Regular homogeneously traceable nonhamiltonian graphs
• Smallest maximally nonhamiltonian graphs
• Smallest maximally nonhamiltonian graphs. II
• The maximum degree of a minimally Hamiltonian-connected graph

This page was built for publication: Graphs with many Hamiltonian paths

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