1. Lecture Notes in Computer Science;N. Alon,2007
2. Lecture Notes in Computer Science;N. Alon,2007
3. Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Spanning directed trees with many leaves. Report arXiv: 0803.0701 (2008)
4. Alt, H., Blum, N., Melhorn, K., Paul, M.: Computing of maximum cardinality matching in a bipartite graph in time
$O(n^{1.5}\sqrt{m/\log n})$
. Inf. Proc. Letters 37, 237–240 (1991)
5. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2000),
www.cs.rhul.ac.uk/books/dbook/