A 2-factor with short cycles passing through specified independent vertices in graph (Q937249): Difference between revisions

@@ Property / cites work @@
+Degree conditions for 2-factors
@@ Property / cites work: Degree conditions for 2-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Two‐factors each component of which contains a specified vertex
+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 @@
+Vertex-disjoint cycles containing specified edges
@@ Property / cites work: Vertex-disjoint cycles containing specified edges / 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 @@
+Vertex-disjoint cycles of length at most four each of which contains a specified vertex
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of independent cycles in a graph
+Normal rank
@@ Property / cites work @@
+Covering a graph with cycles passing through given edges
+Normal rank