Home » Author index

Pullman, Norman J.


Graph Theory » Directed Graphs » Tournaments

Decomposing an even tournament in directed paths. ★★★

Author(s): Alspach; Mason; Pullman

Conjecture   Every tournament $ D $ on an even number of vertices can be decomposed into $ \sum_{v\in V}\max\{0,d^+(v)-d^-(v)\} $ directed paths.

Keywords:

Posted by fhavet
updated February 26th, 2013
add new comment
Syndicate content