Cited in
(only showing first 100 items - show all)- On the upward embedding on the torus
- Non-planar core reduction of graphs
- Testing planarity of geometric automorphisms in linear time
- A simple recognition of maximal planar graphs
- Structure and recognition of graphs with no 6-wheel subdivision
- Untangling a planar graph
- On the complexity of chess
- The 2-linkage problem for acyclic digraphs
- Graph isomorphism problem
- Depth-first search is inherently sequential
- An approach to the subgraph homeomorphism problem
- Analysis of heuristics for finding a maximum weight planar subgraph
- A characterization of planar graphs by Trémaux orders
- Enumeration of articulation pairs of a planar graph
- A linear algorithm for embedding planar graphs using PQ-trees
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Finding small simple cycle separators for 2-connected planar graphs
- A very personal reminiscence on the problem of computational complexity
- An algorithm for the characterization of the nonplanarity of a maximal graphical partition
- Graph graphics: Theory and practice
- On finding optimal and near-optimal lineal spanning trees
- A topological approach to dynamic graph connectivity
- An efficient parallel algorithm for planarity
- Establishing order in planar subdivisions
- A new approach to the linearity of testing planarity of graphs
- Embedding planar graphs in four pages
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- An algorithm for imbedding cubic graphs in the torus
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Representation of graphs
- Improved planarity algorithms
- On the thickness of graphs of given degree
- Planar orientations with low out-degree and compaction of adjacency matrices
- A linear-time algorithm for finding an ambitus
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Area requirement and symmetry display of planar upward drawings
- Light sources, obstructions and spherical orders
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs
- Planar lattices are lexicographically shellable
- An interactive layout heuristic based on hexagonal adjacency graphs
- Computing an st-numbering
- On graphical partitions and planarity
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Checking the convexity of polytopes and the planarity of subdivisions
- Advances in the theory and practice of graph drawing
- Every triangle-free planar graph has a planar upward drawing
- Line directionality of orders
- On counting planar embeddings
- The complexity of finding minimal Voronoi covers with applications to machine learning
- Finding the closed partition of a planar graph
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- Satisfiability of co-nested formulas
- On the orbits of the product of two permutations
- The hybrid spanning tree problem
- Planarity testing in parallel
- The existence of homeomorphic subgraphs in chordal graphs
- The thickness of a minor-excluded class of graphs
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- New results on drawing angle graphs
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
- Projective plan and Möbius band obstructions
- Algorithmic graph embeddings
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Simple planar graph partition into three forests
- A genetic algorithm for determining the thickness of a graph
- Reconstruction graphs and testing their properties in a relational spatial database
- Analogies between the crossing number and the tangle crossing number
- HV-planarity: algorithms and complexity
- Linear-time recognition of map graphs with outerplanar witness
- A method of graph reduction and its applications
- On characteristic and permanent polynomials of a matrix
- Dynamic planar embeddings of dynamic graphs
- A large set of torus obstructions and how they were discovered
- A linear-time algorithm for testing full outer-2-planarity
- Computational study on a PTAS for planar dominating set problem
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Parameterized complexity of the spanning tree congestion problem
- 2-restricted extensions of partial embeddings of graphs
- Planar minimally rigid graphs and pseudo-triangulations
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
- Short encodings of planar graphs and maps
- The minimum spanning tree problem on a planar graph
- Fixed edge-length graph drawing is NP-hard
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
- Sewing ribbons on graphs in space
- An algebra for pomsets.
- The complexity of planarity testing
- Computing crossing numbers in quadratic time
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
- Upward planarity testing
- Drawing planar graphs using the canonical ordering
- Maximum planar subgraphs and nice embeddings: Practical layout tools
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
- Gap strings and spanning forests for bridge graphs of biconnected graphs
- Towards optimal kernel for connected vertex cover in planar graphs
- Graphs with no \(K_{3,3}\) minor containing a fixed edge
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
- A new planarity test
This page was built for publication: Efficient Planarity Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065028)
