The weak 3-flow conjecture and the weak circular flow conjecture

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

Dorit Dor, Michael Tarsi · SIAM Journal on Computing · 1997 · 135 citations

Computing, Computer Science, Mathematics +13

Claw‐decompositions and tutte‐orientations

János Barát, Carsten Thomassen · Journal of Graph Theory · 2006 · 57 citations

Natural Sciences, Mathematics, Combinatorics +7

Decompositions of highly connected graphs into paths of length 3

Carsten Thomassen · Journal of Graph Theory · 2008 · 31 citations · Full text

Natural Sciences, Computer Science, Mathematics +10

Decomposing graphs into paths of fixed length

Carsten Thomassen · COMBINATORICA · 2013 · 20 citations

Computing, Computer Science, Algorithms +9