The following pages link to Efficient Planarity Testing (Q4065028):
Displaying 50 items.
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs (Q266794) (← links)
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243) (← links)
- A note on approximating graph genus (Q290221) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Planar posets, dimension, breadth and the number of minimal elements (Q304190) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- 1-planarity of complete multipartite graphs (Q412349) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- Certifying algorithms (Q465678) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- A computational approach to Conway's thrackle conjecture (Q551503) (← links)
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Errors in graph embedding algorithms (Q632808) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Trémaux trees and planarity (Q661936) (← links)
- Guthrie's problem: new equivalences and rapid reductions (Q672855) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time (Q764322) (← links)
- Invariants of graph drawings in the plane (Q778122) (← links)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
- Edge-contraction problems (Q794164) (← links)
- Network flows and non-guillotine cutting patterns (Q795062) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- Characterization of curve map graphs (Q798330) (← links)
- A refinement of Kuratowski's theorem (Q800369) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
- Classes of cycle bases (Q868389) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Embeddings of graphs with no short noncontractible cycles (Q916669) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class (Q924681) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
