The following pages link to (Q3828034):
Displayed 8 items.
- Minimum cycle factors in quasi-transitive digraphs (Q924641) (← links)
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (Q1356402) (← links)
- Hamiltonian paths containing a given arc, in almost regular bipartite tournaments (Q1877685) (← links)
- Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
- Paths with a given number of vertices from each partite set in regular multipartite tournaments (Q2433729) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815) (← links)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)