PIGALE

swMATH5435MaRDI QIDQ17575

No author found.

Described by source

• On Cotree-Critical and DFS Cotree-Critical Graphs

Related Items (28)

Graph Drawing ⋮ Linkless symmetric drawings of series parallel digraphs ⋮ Recent Advances in Exact Crossing Minimization (Extended Abstract) ⋮ Trémaux Trees and Planarity ⋮ New analysis and computational study for the planar connected dominating set problem ⋮ Unnamed Item ⋮ Topological morphing of planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Drawing trees symmetrically in three dimensions ⋮ Grad and classes with bounded expansion. I: Decompositions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A force-directed algorithm for drawing directed graphs symmetrically ⋮ Trémaux trees and planarity ⋮ Geometric automorphism groups of graphs ⋮ Unnamed Item ⋮ A branch-and-cut approach to the crossing number problem ⋮ Drawing planar graphs symmetrically. II: Biconnected planar graphs ⋮ Drawing planar graphs symmetrically. III: Oneconnected planar graphs ⋮ A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ Efficient Extraction of Multiple Kuratowski Subdivisions ⋮ Non-planar core reduction of graphs ⋮ Testing planarity of geometric automorphisms in linear time ⋮ TRÉMAUX TREES AND PLANARITY ⋮ Computational study on planar dominating set problem ⋮ Unnamed Item

This page was built for software: PIGALE