Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs

DOI10.1016/j.ipl.2021.106192OpenAlexW3197942478WikidataQ114167099 ScholiaQ114167099MaRDI QIDQ2059878

Carol T. Zamfirescu

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106192

zbMATH Keywords

combinatorial problemsHamiltonian cycleplanar graphhypohamiltonian

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal 1-Hamiltonian graphs
• On non-traceable, non-hypotraceable, arachnoid graphs
• On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
• Planar and infinite hypohamiltonian and hypotraceable graphs
• Planar cubic hypohamiltonian and hypotraceable graphs
• Gallai's question and constructions of almost hypotraceable graphs
• Polyhedra of small order and their Hamiltonian properties
• Structural and computational results on platypus graphs
• Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
• Leaf-Critical and Leaf-Stable Graphs
• On planar hypohamiltonian graphs
• A Theorem on Planar Graphs
• On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets
• New constructions of hypohamiltonian and hypotraceable graphs
• Cubic vertices in planar hypohamiltonian graphs
• On Hypohamiltonian and Almost Hypohamiltonian Graphs
• On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs

This page was built for publication: Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs