Local topological toughness and local factors (Q2385135): Difference between revisions

@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / 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 @@
+Toughness and the existence ofk-factors
@@ Property / cites work: Toughness and the existence ofk-factors / rank @@
+Normal rank
@@ Property / cites work @@
+On cycles through specified vertices
@@ Property / cites work: On cycles through specified vertices / rank @@
+Normal rank
@@ Property / cites work @@
+On short cycles through prescribed vertices of a graph
+Normal rank
@@ Property / cites work @@
+On paths and cycles through specified vertices
@@ Property / cites work: On paths and cycles through specified vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and edge-toughness
@@ Property / cites work: Toughness and edge-toughness / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of edge-tough graphs
@@ Property / cites work: Properties of edge-tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+When m vertices in a k-connected graph cannot be walked round along a simple cycle
+Normal rank
@@ Property / cites work @@
+Q3972952
@@ Property / cites work: Q3972952 / rank @@
+Normal rank
@@ Property / cites work @@
+Über die Maximalzahl kreuzungsfreier H-Wege
@@ Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank @@
+Normal rank
@@ Property / cites work @@
+Über ein graphentheoretisches Problem von T. Gallai
+Normal rank