Pages that link to "Item:Q1850562"

The following pages link to Partitioning vertices of a tournament into independent cycles (Q1850562):

Displaying 18 items.

• Complementary cycles in regular bipartite tournaments (Q400394) (← links)
• A survey on Hamilton cycles in directed graphs (Q412269) (← links)
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967) (← links)
• Cycle factors in strongly connected local tournaments (Q965966) (← links)
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
• Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths (Q1677541) (← links)
• Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture (Q1689895) (← links)
• The partition of a strong tournament (Q1772417) (← links)
• All regular multipartite tournaments that are cycle complementary (Q1827717) (← links)
• On disjoint cycles of the same length in tournaments (Q2125644) (← links)
• Lichiardopol's conjecture on disjoint cycles in tournaments (Q2188844) (← links)
• On 1-factors with prescribed lengths in tournaments (Q2284736) (← links)
• Cycles in a tournament with pairwise zero, one or two given vertices in common (Q2470442) (← links)
• All 2-connected in-tournaments that are cycle complementary (Q2483393) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Two proofs of Bermond-Thomassen conjecture for regular tournaments (Q3439564) (← links)
• Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles (Q5265333) (← links)
• Complementary cycles of any length in regular bipartite tournaments (Q6074575) (← links)