Circumferences of 3-connected claw-free graphs (Q267172): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+A reduction method to find spanning Eulerian subgraphs
+Normal rank
@@ Property / cites work @@
+Graphs without spanning closed trails
@@ Property / cites work: Graphs without spanning closed trails / rank @@
+Normal rank
@@ Property / cites work @@
+Fan-type conditions for spanning Eulerian subgraphs
+Normal rank
@@ Property / cites work @@
+Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonicity in 3-connected claw-free graphs
@@ Property / cites work: Hamiltonicity in 3-connected claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Circumferences and minimum degrees in 3-connected claw-free graphs
+Normal rank
@@ Property / cites work @@
+Longest paths and cycles in K1,3-free graphs
@@ Property / cites work: Longest paths and cycles in K1,3-free graphs / 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
@@ Property / cites work @@
+On dominating and spanning circuits in graphs
@@ Property / cites work: On dominating and spanning circuits in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4141844
@@ Property / cites work: Q4141844 / rank @@
+Normal rank