A twelve vertex theorem for 3-connected claw-free graphs (Q292255): Difference between revisions

@@ Property / cites work @@
+Cycles through 23 vertices in 3-connected cubic planar graphs
+Normal rank
@@ Property / cites work @@
+Cycles containing 12 vertices in 3-connected cubic graphs
+Normal rank
@@ Property / cites work @@
+Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
+Normal rank
@@ Property / cites work @@
+The \(*\)-closure for graphs and claw-free graphs
@@ Property / cites work: The \(*\)-closure for graphs and claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A nine vertex theorem for 3-connected claw- free graphs
+Normal rank
@@ Property / cites work @@
+Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
+Normal rank
@@ Property / cites work @@
+Cycles through ten vertices in 3-connected cubic graphs
+Normal rank
@@ Property / cites work @@
+A look at cycles containing specified elements of a graph
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+A nine point theorem for 3-connected graphs
@@ Property / cites work: A nine point theorem for 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5286666
@@ Property / cites work: Q5286666 / rank @@
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / cites work @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank