Algorithms for Drawing Planar p-petal Graphs

DOI10.1080/09720529.2014.932132MaRDI QIDQ2831832zbMATH OpenOpenAlexFDO

Authors V. Kolappan, R. Selvakumar

Publication date 3 November 2016

Published in Journal of Discrete Mathematical Sciences \& Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2014.932132

zbMATH Keywords

planar graph drawing\(p\)-petal graphspetal graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites work

• A linear algorithm for embedding planar graphs using PQ-trees
• A new planarity test
• A unified approach to visibility representations of planar graphs
• Convex Representations of Graphs
• Drawing planar graphs using the canonical ordering
• Efficient Planarity Testing
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
• Improved visibility representation of plane graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Rectangular drawings of plane graphs without designated corners
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Spirality and Optimal Orthogonal Drawings

Cited in

(1)

• An algorithm for constructing star-shaped drawings of plane graphs

This page was built for publication: Algorithms for Drawing Planar p-petal Graphs

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