A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
From MaRDI portal
Publication:2180685
DOI10.1016/j.amc.2020.125233zbMath1460.05106OpenAlexW3017170238MaRDI QIDQ2180685
Herbert Fleischner, Günther R. Raidl, Benedikt Klocker
Publication date: 14 May 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125233
Integer programming (90C10) Linear programming (90C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A degree constraint for uniquely Hamiltonian graphs
- Spanning cycles of nearly cubic graphs
- Vertices of small degree in uniquely Hamiltonian graphs
- Uniquely Hamiltonian Graphs of Minimum Degree 4
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- Solution of a Large-Scale Traveling-Salesman Problem
- On Hamiltonian Circuits
- Cell-probe lower bounds for the partial match problem
This page was built for publication: A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three