A tight Erdős-Pósa function for long cycles (Q2396891): Difference between revisions

@@ Property / cites work @@
+Tree-width and circumference of graphs
@@ Property / cites work: Tree-width and circumference of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős-Pósa property for long circuits
@@ Property / cites work: The Erdős-Pósa property for long circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Long cycles through prescribed vertices have the Erdős‐Pósa property
+Normal rank
@@ Property / cites work @@
+Large-treewidth graph decompositions and applications
+Normal rank
@@ Property / cites work @@
+Q5342984
@@ Property / cites work: Q5342984 / rank @@
+Normal rank
@@ 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 @@
+Q5725269
@@ Property / cites work: Q5725269 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tighter Erdős-Pósa Function for Long Cycles
@@ Property / cites work: A Tighter Erdős-Pósa Function for Long Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles through prescribed vertices
@@ Property / cites work: Packing cycles through prescribed vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Q5530472
@@ Property / cites work: Q5530472 / rank @@
+Normal rank
@@ Property / cites work @@
+Ramanujan graphs
@@ Property / cites work: Ramanujan graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős-Pósa Property for Long Circuits
@@ Property / cites work: The Erdős-Pósa Property for Long Circuits / rank @@
+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 @@
+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