Cited in
(32)- Trémaux trees and planarity
- A branch-and-cut approach to the crossing number problem
- Trémaux trees and planarity
- Drawing trees symmetrically in three dimensions
- TRÉMAUX TREES AND PLANARITY
- Geometric automorphism groups of graphs
- Linkless symmetric drawings of series parallel digraphs
- Non-planar core reduction of graphs
- OGDF
- Tulip
- OpenAD
- GRIP
- Testing planarity of geometric automorphisms in linear time
- New analysis and computational study for the planar connected dominating set problem
- Grad and classes with bounded expansion. I: Decompositions
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
- Handbook of graph drawing and visualization
- Computational study on planar dominating set problem
- scientific article; zbMATH DE number 2080252 (Why is no real title available?)
- scientific article; zbMATH DE number 2084268 (Why is no real title available?)
- Recent advances in exact crossing minimization (extended abstract)
- Graph Drawing
- scientific article; zbMATH DE number 1974110 (Why is no real title available?)
- A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs
- Drawing planar graphs symmetrically. II: Biconnected planar graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
- scientific article; zbMATH DE number 2084277 (Why is no real title available?)
- scientific article; zbMATH DE number 2080114 (Why is no real title available?)
- Topological morphing of planar graphs
- Efficient Extraction of Multiple Kuratowski Subdivisions
- A force-directed algorithm for drawing directed graphs symmetrically
This page was built for software: PIGALE
