Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon

DOI10.1007/978-3-319-28678-5_5zbMath1474.68411OpenAlexW2401987567MaRDI QIDQ2798020

Prosenjit Bose, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid

Publication date: 1 April 2016

Published in: Topics in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01446264/file/385217_1_En_5_Chapter.pdf

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Plane bichromatic trees of low degree