On the 3-tree core of plane graphs
From MaRDI portal
Publication:6636077
DOI10.1007/978-981-97-2340-9_13MaRDI QIDQ6636077FDOQ6636077
Authors: Debajyoti Mondal, Md. Saidur Rahman
Publication date: 12 November 2024
Cites Work
- Intersection graphs of L-shapes and segments in the plane
- How to draw a planar graph on a grid
- A unified approach to visibility representations of planar graphs
- Title not available (Why is that?)
- Minimum-layer drawings of trees (extended abstract)
- The planar slope number of planar partial 3-trees of bounded degree
- Graph Drawing
- Minimum-area drawings of plane 3-trees
- Minimum-width grid drawings of plane graphs
- Canonical ordering trees and their applications in graph drawing
- Optimal \(st\)-orientations for plane triangulations
- Visibility representation of plane graphs via canonical ordering tree
- Height-preserving transformations of planar graph drawings
- Visibility drawings of plane 3-trees with minimum area
- Universal line-sets for drawing planar 3-trees
- Relating graph thickness to planar layers and bend complexity
- Pixel and voxel representations of graphs
- Drawing Planar Graphs with Reduced Height
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 Q6636077)