On the 3-tree core of plane graphs
From MaRDI portal
Publication:6636077
DOI10.1007/978-981-97-2340-9_13MaRDI QIDQ6636077
Md. Saidur Rahman, Debajyoti Mondal
Publication date: 12 November 2024
Cites Work
- Unnamed Item
- Intersection graphs of L-shapes and segments in the plane
- The planar slope number of planar partial 3-trees of bounded degree
- Visibility drawings of plane 3-trees with minimum area
- Ortho-polygon visibility representations of embedded graphs
- How to draw a planar graph on a grid
- Optimal \(st\)-orientations for plane triangulations
- Visibility representation of plane graphs via canonical ordering tree
- A unified approach to visibility representations of planar graphs
- Minimum-width grid drawings of plane graphs
- Canonical ordering trees and their applications in graph drawing
- Height-Preserving Transformations of Planar Graph Drawings
- Pixel and Voxel Representations of Graphs
- Minimum-Layer Drawings of Trees
- Minimum-Area Drawings of Plane 3-Trees
- Relating Graph Thickness to Planar Layers and Bend Complexity
- Universal Line-Sets for Drawing Planar 3-Trees
- Graph Drawing
- Drawing Planar Graphs with Reduced Height
This page was built for publication: On the 3-tree core of plane graphs
