Table of Contents
International Journal of Combinatorics
Volume 2012 (2012), Article ID 273416, 9 pages
http://dx.doi.org/10.1155/2012/273416
Research Article

Vertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebi

Nicolas Lichiardopol, Lycée A. de Craponne, 13651 Salonde Provence Cedex, France

Received 23 January 2011; Revised 26 April 2011; Accepted 30 May 2011

Academic Editor: Charles Semple

Copyright © 2012 Nicolas Lichiardopol. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Bang-Jensen and G. Gutin, Digraphs, Springer Monographs in Mathematics, Springer, New York, NY, USA, 2001.
  2. S. Bessy, N. Lichiardopol, and J.-S. Sereni, “Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree,” Discrete Mathematics, vol. 310, no. 3, pp. 557–560, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. N. Lichiardopol, “Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree,” Discrete Mathematics, vol. 310, no. 19, pp. 2567–2570, 2010. View at Publisher · View at Google Scholar
  4. M. Stiebitz, “Decompositions of graphs and digraphs,” KAM Series in Discrete Mathematics-Combinatorics-Operation Research 95-309, 56-59.
  5. N. Alon, “Splitting digraphs,” Combinatorics, Probability and Computing, vol. 15, no. 6, pp. 933–937, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. K. B. Reid, “Two complementary circuits in two-connected tournaments,” in Cycles in Graphs (Burnaby, B.C., 1982), vol. 115 of North-Holland Math. Stud., pp. 321–334, North-Holland, Amsterdam, The Netherlands, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH