Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2009.07.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2072741658
@@ Property / OpenAlex ID: W2072741658 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting Permutations by Reversals and Eulerian Cycle Decompositions
+Normal rank
@@ Property / cites work @@
+Packing cycles in undirected graphs
@@ Property / cites work: Packing cycles in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Packing triangles in bounded degree graphs.
@@ Property / cites work: Packing triangles in bounded degree graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5342984
@@ Property / cites work: Q5342984 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for cycle packing problems
+Normal rank
@@ Property / cites work @@
+On Edge-Disjoint Cycles in a Graph
@@ Property / cites work: On Edge-Disjoint Cycles in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On packing shortest cycles in graphs
@@ Property / cites work: On packing shortest cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
+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 @@
+Q4775880
@@ Property / cites work: Q4775880 / rank @@
+Normal rank