On the 3-tree core of plane graphs
From MaRDI portal
Cites work
- A unified approach to visibility representations of planar graphs
- Canonical ordering trees and their applications in graph drawing
- Drawing Planar Graphs with Reduced Height
- Graph Drawing
- Graph Drawing
- Height-preserving transformations of planar graph drawings
- How to draw a planar graph on a grid
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 1875438 (Why is no real title available?)
- Intersection graphs of L-shapes and segments in the plane
- Minimum-area drawings of plane 3-trees
- Minimum-layer drawings of trees (extended abstract)
- Minimum-width grid drawings of plane graphs
- On the 3-tree core of plane graphs
- Optimal st-orientations for plane triangulations
- Ortho-polygon visibility representations of embedded graphs
- Pixel and voxel representations of graphs
- The planar slope number of planar partial 3-trees of bounded degree
- Visibility drawings of plane 3-trees with minimum area
- Visibility representation of plane graphs via canonical ordering tree
- Zur allgemeinen Kurventheorie.
This page was built for publication: On the 3-tree core of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939168)