The weak 3-flow conjecture and the weak circular flow conjecture (Q412176): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2011.09.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1964553741
@@ Property / OpenAlex ID: W1964553741 / rank @@
+Normal rank
@@ Property / cites work @@
+Claw‐decompositions and tutte‐orientations
@@ Property / cites work: Claw‐decompositions and tutte‐orientations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4342632
@@ Property / cites work: Q4342632 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
+Normal rank
@@ Property / cites work @@
+Q3682525
@@ Property / cites work: Q3682525 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3807237
@@ Property / cites work: Q3807237 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-decompositions of highly connected graphs into paths
+Normal rank
@@ Property / cites work @@
+Decompositions of highly connected graphs into paths of length 3
+Normal rank
@@ Property / cites work @@
+Decomposing graphs into paths of fixed length
@@ Property / cites work: Decomposing graphs into paths of fixed length / rank @@
+Normal rank