Computing Sharp 2-Factors in Claw-Free Graphs (Q3599127): Difference between revisions

@@ Property / cites work @@
+Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Closure concepts for claw-free graphs
@@ Property / cites work: Closure concepts for claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Regular factors in <i>K</i><sub>1,3</sub>‐free graphs
+Normal rank
@@ Property / cites work @@
+Q4507228
@@ Property / cites work: Q4507228 / rank @@
+Normal rank
@@ Property / cites work @@
+Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs
+Normal rank
@@ Property / cites work @@
+On 2-factors in claw-free graphs
@@ Property / cites work: On 2-factors in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Claw-free graphs---a survey
@@ Property / cites work: Claw-free graphs---a survey / rank @@
+Normal rank
@@ Property / cites work @@
+On traceability and 2-factors in claw-free graphs
@@ Property / cites work: On traceability and 2-factors in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4243804
@@ Property / cites work: Q4243804 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-factors with few cycles in claw-free graphs
@@ Property / cites work: Two-factors with few cycles in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Even subgraphs of bridgeless graphs and 2-factors of line graphs
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian results inK1,3-free graphs
@@ Property / cites work: Hamiltonian results inK1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph factors and factorization: 1985--2003: a survey
+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 @@
+Q4700525
@@ Property / cites work: Q4700525 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of components in 2-factors of claw-free graphs
+Normal rank