Unit disk representations of embedded trees, outerplanar and multi-legged graphs
From MaRDI portal
Publication:2151453
DOI10.1007/978-3-030-92931-2_22MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Unnamed Item
- 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)