Trémaux trees and planarity

DOI10.1016/J.ENDM.2008.06.035zbMATH Open1267.05063OpenAlexW2597215150MaRDI QIDQ5301003FDOQ5301003

Authors: Hubert de Fraysseix 

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.035

Recommendations

• Trémaux trees and planarity
• A characterization of planar graphs by Trémaux orders
• TRÉMAUX TREES AND PLANARITY
• A new planarity test
• Classification and detection of obstructions to planarity

zbMATH Keywords

depth first search treesKuratowski subdivisioncotree critical non-planar graphsHopcroft-Tarjan planarity algorithmplanarity test algorithmTremaux trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• On Cotree-Critical and DFS Cotree-Critical Graphs
• Depth-First Search and Linear Graph Algorithms
• Efficient Planarity Testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• TRÉMAUX TREES AND PLANARITY
• A characterization of planar graphs by Trémaux orders
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Depth-First-Search Characterization of Planarity
• Graph Drawing

Cited In (13)

• A characterization of planar graphs by Trémaux orders
• Trémaux trees and planarity
• An annotated review on graph drawing and its applications
• TRÉMAUX TREES AND PLANARITY
• Plane trees and classical mathematics
• On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
• On Cotree-Critical and DFS Cotree-Critical Graphs
• Planar rooted trees and non-associative exponential series
• Discrete characterizations of planarity part I: the classical viewpoint
• Odd or even on plane trees
• Title not available (Why is that?)
• Planar trees, slalom curves and hyperbolic knots
• Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves

Uses Software

• PIGALE

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)