A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
DOI10.1016/J.AMC.2020.125233zbMATH Open1460.05106OpenAlexW3017170238MaRDI QIDQ2180685FDOQ2180685
Authors: Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
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
Recommendations
Linear programming (90C05) Integer programming (90C10) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Solution of a Large-Scale Traveling-Salesman Problem
- Fast generation of planar graphs
- Title not available (Why is that?)
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Title not available (Why is that?)
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- On Hamiltonian Circuits
- Cell-probe lower bounds for the partial match problem
- Spanning cycles of nearly cubic graphs
- Title not available (Why is that?)
- Vertices of small degree in uniquely Hamiltonian graphs
- A degree constraint for uniquely Hamiltonian graphs
- Uniquely Hamiltonian graphs of minimum degree 4
Cited In (2)
Uses Software
This page was built for publication: A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180685)