Vertex-disjoint cycles in bipartite tournaments
Authors:
- Yandong BaiYBYandong Bai
- Binlong LiBLBinlong Li
- Hao LiHLHao Li
- 1 August 2015
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 338 (8) , 1307-1309
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (11301371, 11271300, 11171273, NEXLIZ-CZ.1.07/2.3.00/30.0038)
- China Scholarship Council (11301371, 11271300, 11171273, NEXLIZ-CZ.1.07/2.3.00/30.0038)
This publication has 9 references indexed in Scilit:
- Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for TournamentsJournal of Graph Theory, 2013
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degreeDiscrete Mathematics, 2010
- Two proofs of the Bermond–Thomassen conjecture for tournaments with bounded minimum in-degreeDiscrete Mathematics, 2010
- A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in DigraphsSIAM Journal on Discrete Mathematics, 2009
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a surveyJournal of Graph Theory, 1995
- Disjoint cycles in digraphsCombinatorica, 1983
- Cycles in bipartite tournamentsJournal of Combinatorial Theory, Series B, 1982
- Long paths and cycles in oriented graphsJournal of Graph Theory, 1981
- Cycles in digraphs– a surveyJournal of Graph Theory, 1981