Minimum-segment convex drawings of 3-connected cubic plane graphs

DOI10.1007/S10878-011-9390-6MaRDI QIDQ2377378zbMATH OpenOpenAlexFDO

Authors Debajyoti Mondal, Rahnuma Islam Nishat, Sudip Biswas, Md. Saidur Rahman

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

zbMATH Keywords

convex drawingcubic graphgraph drawinggrid drawingminimum-segment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)
• scientific article; zbMATH DE number 2234520
• scientific article; zbMATH DE number 2104042
• Convex drawings of 3-connected plane graphs
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments

Cites work

• Convex drawings of planar graphs and the order dimension of 3-polytopes
• Convex Representations of Graphs
• Drawing cubic graphs with at most five slopes
• Drawing planar graphs using the canonical ordering
• Drawing plane graphs nicely
• Drawings of planar graphs with few slopes and segments
• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 3885930 (Why is no real title available?)
• scientific article; zbMATH DE number 512936 (Why is no real title available?)
• Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
• Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)
• Output-sensitive reporting of disjoint paths

Cited in

(14)

• Drawing plane triangulations with few segments
• 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
• A note on minimum-segment drawings of planar graphs
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)
• Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
• Drawing planar graphs with few geometric primitives
• Drawing graphs on few circles and few spheres
• CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
• The segment number: algorithms and universal lower bounds for some classes of planar graphs
• An annotated review on graph drawing and its applications

This page was built for publication: Minimum-segment convex drawings of 3-connected cubic plane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377378)