Minimum-segment convex drawings of 3-connected cubic plane graphs
From MaRDI portal
Publication:2377378
DOI10.1007/s10878-011-9390-6zbMath1271.90071OpenAlexW2097676168MaRDI QIDQ2377378
Rahnuma Islam Nishat, Md. Saidur Rahman, Sudip Biswas, Debajyoti Mondal
Publication date: 28 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9390-6
Related Items (9)
Drawing plane triangulations with few segments ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ The segment number: algorithms and universal lower bounds for some classes of planar graphs ⋮ An annotated review on graph drawing and its applications ⋮ Drawing planar graphs with few segments on a polynomial grid ⋮ Variants of the segment number of a graph ⋮ Drawing partial 2-trees with few slopes ⋮ Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments ⋮ Drawing Graphs on Few Circles and Few Spheres
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing plane graphs nicely
- Output-sensitive reporting of disjoint paths
- Drawing planar graphs using the canonical ordering
- Drawings of planar graphs with few slopes and segments
- Drawing cubic graphs with at most five slopes
- Convex Representations of Graphs
- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: Minimum-segment convex drawings of 3-connected cubic plane graphs