When m vertices in a k-connected graph cannot be walked round along a simple cycle (Q1159693): Difference between revisions

@@ Property / author @@
-Alexander K. Kelmans
@@ Property / author: Alexander K. Kelmans / rank @@
-Normal rank
@@ Property / author @@
-Q585079
@@ Property / author: Q585079 / rank @@
-Normal rank
@@ Property / author @@
+Alexander K. Kelmans
@@ Property / author: Alexander K. Kelmans / rank @@
+Normal rank
@@ Property / author @@
+Michael V. Lomonosov
@@ Property / author: Michael V. Lomonosov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+‐chrome Graphen und vollständige 4‐Graphen
@@ Property / cites work: 4‐chrome Graphen und vollständige 4‐Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank