\(K_{1,3}\)-factors in graphs (Q998329): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2007.11.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2055226951
@@ Property / OpenAlex ID: W2055226951 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent circuits in a graph
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint claws in graphs
@@ Property / cites work: Vertex-disjoint claws in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On circuits in graphs
@@ Property / cites work: On circuits in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3211348
@@ Property / cites work: Q3211348 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5620621
@@ Property / cites work: Q5620621 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph
+Normal rank
@@ Property / cites work @@
+Proof of the Alon-Yuster conjecture
@@ Property / cites work: Proof of the Alon-Yuster conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+An El-Zah�r type condition ensuring path-factors
+Normal rank