Drawing planar graphs symmetrically. III: Oneconnected planar graphs
From MaRDI portal
Publication:2492626
DOI10.1007/s00453-005-1149-yzbMath1092.68075OpenAlexW4255751875MaRDI QIDQ2492626
Publication date: 14 June 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1149-y
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Geometric automorphism groups of graphs ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ Testing planarity of geometric automorphisms in linear time
Uses Software