Pages that link to "Item:Q1677541"
From MaRDI portal
The following pages link to Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths (Q1677541):
Displaying 16 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Bipartitions of highly connected tournaments (Q322194) (← links)
- The partition of a strong tournament (Q1772417) (← links)
- Degree constrained 2-partitions of semicomplete digraphs (Q1784748) (← links)
- Partitioning vertices of a tournament into independent cycles (Q1850562) (← links)
- An improved linear connectivity bound for tournaments to be highly linked (Q1979428) (← links)
- Spanning trees of dense directed graphs (Q2132400) (← links)
- On 1-factors with prescribed lengths in tournaments (Q2284736) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (Q2922881) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Elementary proof of a counting formula for acyclic bipartite tournaments (Q4857431) (← links)
- Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs (Q5222543) (← links)
- Sparse Spanning $k$-Connected Subgraphs in Tournaments (Q5361237) (← links)
- Disjoint Cycles in a Digraph with Partial Degree (Q5883282) (← links)
- Complementary cycles of any length in regular bipartite tournaments (Q6074575) (← links)
