\(k\) disjoint cycles containing specified independent vertices (Q2519840): Difference between revisions

@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Degree conditions for 2-factors
@@ Property / cites work: Degree conditions for 2-factors / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent circuits in a graph
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint cycles containing specified edges
@@ Property / cites work: Vertex-disjoint cycles containing specified edges / rank @@
+Normal rank
@@ Property / cites work @@
+Covering vertices of a graph by \(k\) disjoint cycles
+Normal rank
@@ Property / cites work @@
+Existence of two disjoint long cycles in graphs
@@ Property / cites work: Existence of two disjoint long cycles 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 @@
+A note on 2-factors with two components
@@ Property / cites work: A note on 2-factors with two components / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of a theorem on cycles containing specified independent edges
+Normal rank
@@ Property / cites work @@
+Q3826605
@@ Property / cites work: Q3826605 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
+Normal rank
@@ Property / cites work @@
+Covering a graph with cycles passing through given edges
+Normal rank