The following pages link to Efficient Planarity Testing (Q4065028):
Displaying 50 items.
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811) (← links)
- On the upward embedding on the torus (Q1010987) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Testing planarity of geometric automorphisms in linear time (Q1018045) (← links)
- A simple recognition of maximal planar graphs (Q1029086) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- Untangling a planar graph (Q1042455) (← links)
- On the complexity of chess (Q1054641) (← links)
- The 2-linkage problem for acyclic digraphs (Q1057282) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924) (← links)
- A characterization of planar graphs by Trémaux orders (Q1065816) (← links)
- Enumeration of articulation pairs of a planar graph (Q1071024) (← links)
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- A unified approach to visibility representations of planar graphs (Q1085167) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- A very personal reminiscence on the problem of computational complexity (Q1091818) (← links)
- An algorithm for the characterization of the nonplanarity of a maximal graphical partition (Q1095148) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- A topological approach to dynamic graph connectivity (Q1108030) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- Establishing order in planar subdivisions (Q1115185) (← links)
- A new approach to the linearity of testing planarity of graphs (Q1117237) (← links)
- Embedding planar graphs in four pages (Q1120582) (← links)
- Hex ist Pspace-vollständig. (Hex is Pspace-complete) (Q1138494) (← links)
- An algorithm for imbedding cubic graphs in the torus (Q1140090) (← links)
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs (Q1144938) (← links)
- Representation of graphs (Q1157966) (← links)
- Improved planarity algorithms (Q1161292) (← links)
- On the thickness of graphs of given degree (Q1174334) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- A linear-time algorithm for finding an ambitus (Q1186786) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Light sources, obstructions and spherical orders (Q1193424) (← links)
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs (Q1193898) (← links)
- Planar lattices are lexicographically shellable (Q1198483) (← links)
- An interactive layout heuristic based on hexagonal adjacency graphs (Q1205707) (← links)
- Computing an st-numbering (Q1231771) (← links)
- On graphical partitions and planarity (Q1237749) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
