Highly Influenced

# 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} }

- Published 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

#### From This Paper

##### Figures, tables, and topics from this paper.

11 Citations

27 References

Similar Papers