Unit disk representations of embedded trees, outerplanar and multi-legged graphs

DOI10.1007/978-3-030-92931-2_22OpenAlexW3194602993MaRDI QIDQ2151453

Sujoy Bhore, Soeren Nickel, Martin Nöllenburg, Maarten Löffler

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/2103.08416

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Classes and recognition of curve contact graphs
• Unit disk graph recognition is NP-hard
• Planar graphs have 1-string representations
• Rectangle and Square Representations of Planar Graphs
• Recognizing Weighted Disk Contact Graphs
• Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
• Planar Graphs as VPG-Graphs
• Representing graphs by disks and balls (a survey of recognition-complexity results)
• Unnamed Item

This page was built for publication: Unit disk representations of embedded trees, outerplanar and multi-legged graphs