Pages that link to "Item:Q666527"
From MaRDI portal
The following pages link to Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz (Q666527):
Displaying 11 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree (Q708429) (← links)
- On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\) (Q966016) (← links)
- On splitting digraphs (Q1750217) (← links)
- Degree constrained 2-partitions of semicomplete digraphs (Q1784748) (← links)
- On the parameterized complexity of 2-partitions (Q2205943) (← links)
- On 1-factors with prescribed lengths in tournaments (Q2284736) (← links)
- Highly linked tournaments with large minimum out-degree (Q2338640) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Partition and disjoint cycles in digraphs (Q2698538) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
