Some problems in graph theory and graphs algorithmic theory

@inproceedings{Bessy2012SomePI,
  title={Some problems in graph theory and graphs algorithmic theory},
  author={St{\'e}phane Bessy},
  year={2012}
}
The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r − 1 contains at least r vertex-disjoint directed cycles. Thomassen proved that it is true when r = 2, and very recently the conjecture was proved for the case where r = 3. It is still open for larger values of r, even when restricted to (regular) tournaments. In this paper, we present two proofs of this conjecture for tournaments with minimum out-degree and minimum in-degree at… CONTINUE READING
11 Citations
27 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Design theory

  • C. C. Lindner, C. A. Rodger
  • CRC Press, Inc. Boca Raton, FL
  • 1997
Highly Influential
8 Excerpts

Complexité paramétrique et recherche de noyaux

  • A. Perez
  • Master’s thesis, Université de Montpellier 2…
  • 2008

Similar Papers

Loading similar papers…