4-connected triangulations and 4-orderedness (Q708369): Difference between revisions

@@ Property / cites work @@
+Survey of results on \(k\)-ordered graphs
@@ Property / cites work: Survey of results on \(k\)-ordered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Degree conditions for <i>k</i>‐ordered hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+-connected maximal planar graphs are 4-ordered
@@ Property / cites work: 4-connected maximal planar graphs are 4-ordered / rank @@
+Normal rank
@@ Property / cites work @@
+On 3-regular 4-ordered graphs
@@ Property / cites work: On 3-regular 4-ordered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+k-ordered Hamiltonian graphs
@@ Property / cites work: k-ordered Hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Non-existence of graph embeddings
@@ Property / cites work: Non-existence of graph embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs
@@ Property / cites work: Disjoint paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank
@@ Property / cites work @@
+An improved linear edge bound for graph linkages
@@ Property / cites work: An improved linear edge bound for graph linkages / rank @@
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked graphs / rank @@
+Normal rank