Pages that link to "Item:Q3960721"
From MaRDI portal
The following pages link to A Depth-First-Search Characterization of Planarity (Q3960721):
Displaying 15 items.
- Trémaux trees and planarity (Q661936) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- A large set of torus obstructions and how they were discovered (Q1700776) (← links)
- Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) (← links)
- Upward planarity testing (Q1904391) (← links)
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (Q1920431) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- On Boolean characterizations of planarity and planar embeddings of graphs (Q2276969) (← links)
- (Q2702747) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- Recent Advances in Exact Crossing Minimization (Extended Abstract) (Q5300976) (← links)
- Trémaux Trees and Planarity (Q5301003) (← links)
