Covering a strong diagraph by a - 1 disjoint paths: A proof of Las Vergnas' conjecture

Journal of Combinatorial Theory. Series B

Volumn 83, Issue 2, 2001, Pages 331-333

  Thomassé, Stéphan ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035193119     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2055     Document Type: Article

References (7)

1. Path partitions in directed graphs
2. Basic graph theory: Paths and circuits
3. A short proof of the Chen-Manalastas theorem
4. Chemins et circuits hamiltoniens des graphes complets
5. Every finite strongly connected digraph of stability 2 has a Hamiltonian path
6. Verallgemeinerung eines graphentheoretischen Satzes von Rédei
7. Sur les arborescences dans un graphe orienté