Packing cycles through prescribed vertices under modularity constraints (Q444427): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.aam.2012.03.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1989287241
@@ Property / OpenAlex ID: W1989287241 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles in undirected graphs
@@ Property / cites work: Packing cycles in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Subset Feedback Vertex Set Is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Highly connected sets and the excluded grid theorem
+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 @@
+Q5759552
@@ Property / cites work: Q5759552 / rank @@
+Normal rank
@@ Property / cites work @@
+An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
+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 @@
+Q5743513
@@ Property / cites work: Q5743513 / 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 @@
+Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
+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 @@
+Q4352948
@@ Property / cites work: Q4352948 / 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 @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs
@@ Property / cites work: Disjoint paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the presence of disjoint subgraphs of a specified type
+Normal rank
@@ Property / cites work @@
+Packing cycles with modularity constraints
@@ Property / cites work: Packing cycles with modularity constraints / rank @@
+Normal rank