This is my web page on Woodall's conjecture for directed graphs. The conjecture states that in any directed graph the number of pairwise disjoint dijoins is equal to the size of a minimum dicut. The conjecture reduces do the following statement: if every directed cut of the graph has k or more arcs then the graph has at least k pairwise disjoint dijoins.
Other sites: Algorithms Design in C | Literate Programming & CWEB | Uma Introdução Sucinta à Teoria dos Grafos | Algoritmos em Grafos com Stanford GraphBase | Minicurso de Análise de Algoritmos | Algoritmos de Aproximação