The following pages link to (Q3412126):
Displaying 6 items.
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967) (← 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 the number of cycles in local tournaments (Q1025457) (← links)
- The interchange graphs of tournaments with minimum score vectors are exactly hypercubes (Q1043788) (← links)
- Highly linked tournaments with large minimum out-degree (Q2338640) (← links)
- Tournaments whose indecomposability graph admits a vertex cover of size 2. (Q2829069) (← links)
