The following pages link to (Q4325297):
Displayed 11 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Minimum cycle factors in quasi-transitive digraphs (Q924641) (← links)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (Q1356402) (← links)
- Vertex heaviest paths and cycles in quasi-transitive digraphs (Q1356546) (← links)
- Paths and cycles in extended and decomposable digraphs (Q1356688) (← links)
- Kings in quasi-transitive digraphs (Q1584249) (← links)
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs (Q1584322) (← links)
- Weakly Hamiltonian-connected ordinary multipartite tournaments (Q1842145) (← links)
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815) (← links)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)