[1] DeVos M., Nešetřil J., Raspaud A.: Antisymmetric Flows and Edge connectivity. Discrete Math. 276 (2004), No. 1-3, 161–167. MR 2046631 | Zbl 1031.05062

[2] Diestel R.: Graph Theory. Springer 2000. MR 1743598 | Zbl 1218.05001

[3] Graham R. L., Grotschel M., Lovasz L. (editors): Handbook of Combinatorics. North-Holland 1995.

[4] Lang S.: Algebra. Chapter I, §8, Springer 2002. MR 1878556 | Zbl 1063.00002

[5] Nešetřil J., Raspaud A.: Antisymmetric Flows and Strong Colourings of Oriented graphs. An. Inst. Fourier (Grenoble) 49, 3 (1999), 1037–1056. MR 1703437 | Zbl 0921.05034

[6] Rohrbach H., Weis J.: Zum finiten Fall des Bertrandschen Postulats. J. Reine Angew. Math., 214/5 (1964), 432–440. MR 0161820 | Zbl 0131.04403

[7] Singer J.: A theorem in finite projective geometry and some applications to number theory. Trans. Amer. Math. Soc. 43 (1938) 377–385. MR 1501951 | Zbl 0019.00502

[8] Srinivasan B. R.: On the number of Abelian groups of a given order. Acta Arith. 23 (1973), 195–205. MR 0337841 | Zbl 0228.10022

[9] Šámal R.: Antisymmetric flows and strong oriented coloring of planar graphs. EuroComb’01 (Barcelona), Discrete Math. 273 (2003), no. 1-3, 203–209. MR 2025951 | Zbl 1029.05054

[10] Šámal R.: Flows and Colorings of Graphs. Proceedings of the conference Week of Doctoral Students 2002, Charles University in Prague, Faculty of Mathematics and Physics.