The following pages link to (Q4422265):
Displaying 10 items.
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs (Q948692) (← links)
- Testing planarity of geometric automorphisms in linear time (Q1018045) (← links)
- A force-directed algorithm for drawing directed graphs symmetrically (Q1721190) (← links)
- Linkless symmetric drawings of series parallel digraphs (Q1886237) (← links)
- Improved group theoretic method using graph products for the analysis of symmetric-regular structures (Q2268003) (← links)
- Geometric automorphism groups of graphs (Q2457002) (← links)
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs (Q2492626) (← links)
- Logic Programming with Graph Automorphism: Integrating<tt>nauty</tt>with Prolog (Tool Description) (Q4593050) (← links)
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
- On automorphisms and fixing number of co-normal product of graphs (Q6669292) (← links)
