scientific article; zbMATH DE number 7559229
From MaRDI portal
Publication:5088959
DOI10.4230/LIPICS.SOCG.2019.29MaRDI QIDQ5088959FDOQ5088959
Authors: Vida Dujmović, Pat Morin 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.03427
Title of this publication is not available (Why is that?)
planar graphsuntanglingcollinear setscolumn planaritypartial simultaneous geometric drawingsuniversal point subsets
Cites Work
- The four-colour theorem
- Circumference of 3-connected cubic graphs
- Untangling a planar graph
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Longest cycles in 3-connected cubic graphs
- Trees in Polyhedral Graphs
- On Hamiltonian Circuits
- Shortness exponents of families of graphs
- Longest Cycles in 3-Connected 3-Regular Graphs
- Triangulating planar graphs while minimizing the maximum degree
- A polynomial bound for untangling geometric planar graphs
- Untangling a polygon
- On collinear sets in straight-line drawings
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- Untangling planar graphs from a specified vertex position-Hard cases
- Untangling polygons and graphs
- Universal point subsets for planar graphs
- Every collinear set in a planar graph is free
- SEFE without mapping via large induced outerplane graphs in plane graphs
- Column Planarity and Partial Simultaneous Geometric Embedding
- Column planarity and partially-simultaneous geometric embedding
- Drawing planar graphs with many collinear vertices
- The Utility of Untangling
Cited In (1)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088959)
