A left-first search algorithm for planar graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3949734 (Why is no real title available?)
- scientific article; zbMATH DE number 4049090 (Why is no real title available?)
- scientific article; zbMATH DE number 4060744 (Why is no real title available?)
- scientific article; zbMATH DE number 739017 (Why is no real title available?)
- scientific article; zbMATH DE number 6157237 (Why is no real title available?)
- scientific article; zbMATH DE number 4198020 (Why is no real title available?)
- A unified approach to visibility representations of planar graphs
- Bipartite graphs, upward drawings, and planarity
- Bipolar orientations revisited
- Computing an st-numbering
- How to draw a planar graph on a grid
- Intersection graphs of curves in the plane
- Light sources, obstructions and spherical orders
- On grid intersection graphs
- On the Classification of Graphs
- Planar lattices and planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Two trees in maximal planar bipartite graphs
- st-ordering the vertices of biconnected graphs
Cited in
(23)- scientific article; zbMATH DE number 1947450 (Why is no real title available?)
- Mixed linear layouts: complexity, heuristics, and experiments
- Depth-First Search in Directed Planar Graphs, Revisited
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
- Vertex contact graphs of paths on a grid
- On mixed linear layouts of series-parallel graphs
- On Mixed Linear Layouts of Series-Parallel Graphs
- 4-labelings and grid embeddings of plane quadrangulations
- Extension of a theorem of Whitney
- Recognizing DAGs with page-number 2 is NP-complete
- Orthogonal segment stabbing
- On the number of rectangulations of a planar point set
- Planar 3-SAT with a clause/variable cycle
- Recognizing DAGs with page-number 2 is NP-complete
- Planar bus graphs
- Bijections for Baxter families and related objects
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- On partitioning the edges of 1-plane graphs
- The Rique-number of graphs
- Drawings of planar graphs with few slopes and segments
- On Representation of Planar Graphs by Segments
- Crossing patterns of segments
This page was built for publication: A left-first search algorithm for planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892422)
