All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) (Q1800414): Difference between revisions

@@ Property / cites work @@
+Weight of 3-paths in sparse plane graphs
@@ Property / cites work: Weight of 3-paths in sparse plane graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal vertex degree sum of a 3-path in plane maps
+Normal rank
@@ Property / cites work @@
+Describing tight descriptions of 3-paths in triangle-free normal plane maps
+Normal rank
@@ Property / cites work @@
+An analogue of Franklin's theorem
@@ Property / cites work: An analogue of Franklin's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Describing 3-paths in normal plane maps
@@ Property / cites work: Describing 3-paths in normal plane maps / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Descriptions of 3‐Paths in Normal Plane Maps
+Normal rank
@@ Property / cites work @@
+A structural property of convex 3-polytopes
@@ Property / cites work: A structural property of convex 3-polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Paths with restricted degrees of their vertices in planar graphs
+Normal rank
@@ Property / cites work @@
+Describing short paths in plane graphs of girth at least 5
+Normal rank
@@ Property / cites work @@
+-paths in graphs with bounded average degree
@@ Property / cites work: 3-paths in graphs with bounded average degree / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
+Normal rank
@@ Property / cites work @@
+Note on 3-paths in plane graphs of girth 4
@@ Property / cites work: Note on 3-paths in plane graphs of girth 4 / rank @@
+Normal rank