Non-permitted journeys and Hamiltonian paths

MaRDI QIDQ5012282zbMATH OpenFDO

Authors Mark Stander

Publication date 31 August 2021

zbMATH Keywords

allowed paths

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• On the number of maximally non-Hamiltonian graphs
• Construction of Hamiltonian paths in graphs of permutation polyhedra
• Families of locally separated Hamilton paths
• The maximum number of Hamiltonian paths in tournaments
• Simple Paths and Cycles Avoiding Forbidden Paths

This page was built for publication: Non-permitted journeys and Hamiltonian paths

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