Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896): Difference between revisions

@@ Property / cites work @@
+More Canonical Ordering
@@ Property / cites work: More Canonical Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Q5589866
@@ Property / cites work: Q5589866 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411355
@@ Property / cites work: Q4411355 / rank @@
+Normal rank
@@ Property / cites work @@
+The (3,1)-ordering for 4-connected planar triangulations
+Normal rank
@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Orderly Spanning Trees with Applications
@@ Property / cites work: Orderly Spanning Trees with Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Four Independent Trees
@@ Property / cites work: Finding Four Independent Trees / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Output-sensitive reporting of disjoint paths
@@ Property / cites work: Output-sensitive reporting of disjoint paths / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Q4472293
@@ Property / cites work: Q4472293 / rank @@
+Normal rank
@@ Property / cites work @@
+Partition conditions and vertex-connectivity of graphs
+Normal rank
@@ Property / cites work @@
+Independent trees in planar graphs
@@ Property / cites work: Independent trees in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic orthogonal segment intersection search
@@ Property / cites work: Dynamic orthogonal segment intersection search / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+Q4230331
@@ Property / cites work: Q4230331 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing planar graphs using the canonical ordering
+Normal rank
@@ Property / cites work @@
+A homology theory for spanning tress of a graph
@@ Property / cites work: A homology theory for spanning tress of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying algorithms
@@ Property / cites work: Certifying algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying 3-edge-connectivity
@@ Property / cites work: Certifying 3-edge-connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Construction Sequences and Certifying 3-Connectedness
+Normal rank
@@ Property / cites work @@
+Contractions, Removals, and Certifying 3-Connectivity in Linear Time
+Normal rank
@@ Property / cites work @@
+A Planarity Test via Construction Sequences
@@ Property / cites work: A Planarity Test via Construction Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Kuratowski's theorem
@@ Property / cites work: Kuratowski's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining order in a generalized linked list
@@ Property / cites work: Maintaining order in a generalized linked list / rank @@
+Normal rank
@@ Property / cites work @@
+How to Draw a Graph
@@ Property / cites work: How to Draw a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5524326
@@ Property / cites work: Q5524326 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-Separable and Planar Graphs
@@ Property / cites work: Non-Separable and Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Three tree-paths
@@ Property / cites work: Three tree-paths / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on Polytopes
@@ Property / cites work: Lectures on Polytopes / rank @@
+Normal rank