Blockers for simple Hamiltonian paths in convex geometric graphs of even order
From MaRDI portal
Publication:724939
DOI10.1007/s00454-017-9921-8zbMath1392.05065arXiv1607.01034OpenAlexW2963255978MaRDI QIDQ724939
Publication date: 26 July 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.01034
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
The complexity of blocking (semi)total dominating sets with edge contractions ⋮ Blockers for triangulations of a convex polygon and a geometric maker-breaker game ⋮ Blockers for simple Hamiltonian paths in convex geometric graphs of odd order ⋮ Using edge contractions to reduce the semitotal domination number
Cites Work
This page was built for publication: Blockers for simple Hamiltonian paths in convex geometric graphs of even order