On Representation of Planar Graphs by Segments
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 739017
- Segment representation of a subclass of co-planar graphs
- Representations of Planar Graphs
- Interval representations of planar graphs
- On the path separability of planar graphs
- scientific article; zbMATH DE number 3882450
- The segment number: algorithms and universal lower bounds for some classes of planar graphs
- A note on minimum-segment drawings of planar graphs
- Planarizing graphs and their drawings by vertex splitting
- scientific article; zbMATH DE number 1500690
Cites work
- A left-first search algorithm for planar graphs
- A unified approach to visibility representations of planar graphs
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Graph Drawing
- scientific article; zbMATH DE number 739017 (Why is no real title available?)
- scientific article; zbMATH DE number 3315017 (Why is no real title available?)
- Nearly Optimal Visibility Representations of Plane Graphs
- Output-sensitive reporting of disjoint paths
- Rectilinear planar layouts and bipolar orientations of planar graphs
Cited in
(1)
This page was built for publication: On Representation of Planar Graphs by Segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511438)