scientific article; zbMATH DE number 7559229
From MaRDI portal
Publication:5088959
DOI10.4230/LIPIcs.SoCG.2019.29MaRDI QIDQ5088959
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.03427
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
planar graphsuntanglingcollinear setscolumn planaritypartial simultaneous geometric drawingsuniversal point subsets
Cites Work
- Untangling planar graphs from a specified vertex position-Hard cases
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Untangling polygons and graphs
- A polynomial bound for untangling geometric planar graphs
- Untangling a planar graph
- Longest cycles in 3-connected cubic graphs
- Triangulating planar graphs while minimizing the maximum degree
- The four-colour theorem
- Circumference of 3-connected cubic graphs
- Untangling a polygon
- Every collinear set in a planar graph is free
- Shortness exponents of families of graphs
- SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs
- Column Planarity and Partial Simultaneous Geometric Embedding
- On Collinear Sets in Straight-Line Drawings
- Longest Cycles in 3-Connected 3-Regular Graphs
- Drawing planar graphs with many collinear vertices
- Universal Point Subsets for Planar Graphs
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- Column planarity and partially-simultaneous geometric embedding
- Trees in Polyhedral Graphs
- On Hamiltonian Circuits
- The Utility of Untangling
This page was built for publication:
