Finding planar geometric automorphisms in planar graphs (extended abstract)

DOI10.1007/3-540-49381-6_30MaRDI QIDQ4249532zbMATH OpenFDO

Authors Seok-Hee Hong, Peter Eades, Sang-Ho Lee

Publication date 17 August 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49381-6_30

zbMATH Keywords

planar geometric automorphismspolynomial time algorithmsymmetric drawings of planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• Drawing planar graphs symmetrically. III: Oneconnected planar graphs
• Geometric automorphism groups of graphs
• Testing planarity of geometric automorphisms in linear time
• scientific article; zbMATH DE number 2119683

Cited in

(9)

• Testing planarity of geometric automorphisms in linear time
• Spring algorithms and symmetry
• Drawing series parallel digraphs symmetrically
• Linkless symmetric drawings of series parallel digraphs
• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• scientific article; zbMATH DE number 4045185 (Why is no real title available?)
• scientific article; zbMATH DE number 1234976 (Why is no real title available?)
• scientific article; zbMATH DE number 1974110 (Why is no real title available?)
• scientific article; zbMATH DE number 1389215 (Why is no real title available?)

This page was built for publication: Finding planar geometric automorphisms in planar graphs (extended abstract)

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