A group-theoretic method for drawing graphs symmetrically

DOI10.1007/3-540-36151-0_9MaRDI QIDQ4422265zbMATH OpenFDO

Authors David Abelson, Seok-Hee Hong, D. E. Taylor

Publication date 3 September 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2528/25280086.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Geometric automorphism groups of graphs
• scientific article; zbMATH DE number 2084277
• Drawing planar graphs symmetrically. II: Biconnected planar graphs
• Finding planar geometric automorphisms in planar graphs (extended abstract)
• Drawing planar graphs symmetrically. III: Oneconnected planar graphs

Cited in

(11)

• Testing planarity of geometric automorphisms in linear time
• A force-directed algorithm for drawing directed graphs symmetrically
• Linkless symmetric drawings of series parallel digraphs
• Improved group theoretic method using graph products for the analysis of symmetric-regular structures
• Geometric automorphism groups of graphs
• Drawing planar graphs symmetrically. III: Oneconnected planar graphs
• Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
• scientific article; zbMATH DE number 2086772 (Why is no real title available?)
• A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
• On automorphisms and fixing number of co-normal product of graphs
• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs

Describes a project that uses

Uses Software

• PIGALE

This page was built for publication: A group-theoretic method for drawing graphs symmetrically

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