Packing cycles through prescribed vertices (Q2275896): Difference between revisions

@@ Property / cites work @@
+On Independent Circuits Contained in a Graph
@@ Property / cites work: On Independent Circuits Contained in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the odd-minor variant of Hadwiger's conjecture
@@ Property / cites work: On the odd-minor variant of Hadwiger's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for cycle packing problems
+Normal rank
@@ Property / cites work @@
+Disjoint cycles intersecting a set of vertices
@@ Property / cites work: Disjoint cycles intersecting a set of vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Packing directed circuits
@@ Property / cites work: Packing directed circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
+Normal rank
@@ Property / cites work @@
+On the presence of disjoint subgraphs of a specified type
+Normal rank