Trémaux trees and planarity
From MaRDI portal
Publication:5301003
Recommendations
Cites work
- scientific article; zbMATH DE number 3831962 (Why is no real title available?)
- scientific article; zbMATH DE number 2084268 (Why is no real title available?)
- scientific article; zbMATH DE number 3929029 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- A Depth-First-Search Characterization of Planarity
- A characterization of planar graphs by Trémaux orders
- Depth-First Search and Linear Graph Algorithms
- Efficient Planarity Testing
- Graph Drawing
- On Cotree-Critical and DFS Cotree-Critical Graphs
- TRÉMAUX TREES AND PLANARITY
Cited in
(13)- Discrete characterizations of planarity part I: the classical viewpoint
- An annotated review on graph drawing and its applications
- Plane trees and classical mathematics
- Planar rooted trees and non-associative exponential series
- Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
- scientific article; zbMATH DE number 3929029 (Why is no real title available?)
- On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
- Odd or even on plane trees
- A characterization of planar graphs by Trémaux orders
- TRÉMAUX TREES AND PLANARITY
- Trémaux trees and planarity
- Planar trees, slalom curves and hyperbolic knots
- On Cotree-Critical and DFS Cotree-Critical Graphs
This page was built for publication: Trémaux trees and planarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301003)