Planar projections of graphs
From MaRDI portal
Publication:5896110
DOI10.1007/978-3-030-39219-2_36zbMath1453.68121arXiv2010.01286OpenAlexW3001109720MaRDI QIDQ5896110
Publication date: 21 July 2020
Published in: Discrete Applied Mathematics, Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.01286
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On graph thickness, geometric thickness, and separator theorems
- Thickness and colorability of geometric graphs
- On star and caterpillar arboricity
- The linear arboricity of graphs
- On the thickness of graphs of given degree
- The thickness of graphs: A survey
- On representations of some thickness-two graphs
- Bounded-degree graphs have arbitrarily large geometric thickness
- Column Planarity and Partial Simultaneous Geometric Embedding
- Characterization of Unlabeled Level Planar Trees
- The linear arboricity of some regular graphs
- Geometric Thickness of Complete Graphs
- The geometric thickness of low degree graphs
- Characterization of Unlabeled Level Planar Graphs