scientific article; zbMATH DE number 1303032

zbMATH Open0923.05022MaRDI QIDQ4249532FDOQ4249532

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

Publication date: 17 August 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

polynomial time algorithmplanar geometric automorphismssymmetric drawings of planar graphs

Mathematics Subject Classification ID

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

Cited In (9)

• Linkless symmetric drawings of series parallel digraphs
• Title not available (Why is that?)
• Testing planarity of geometric automorphisms in linear time
• Spring algorithms and symmetry
• Title not available (Why is that?)
• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• Title not available (Why is that?)
• Drawing series parallel digraphs symmetrically
• Title not available (Why is that?)

This page was built for publication:

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