Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
101
click to vote
DM
2010
66
views
more
DM 2010
»
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
15 years 3 months ago
Download
hal.archives-ouvertes.fr
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. Thoma...
Stéphane Bessy, Nicolas Lichiardopol, Jean-...
claim paper
Read More »