The following pages link to (Q4325297):
Displaying 20 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)
- A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257) (← links)
- Extended path partition conjecture for semicomplete and acyclic compositions (Q2166278) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs (Q2305930) (← links)
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815) (← links)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)
- Packing strong subgraph in digraphs (Q2684051) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- (Q3140457) (← links)
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916) (← links)
- Semicomplete compositions of digraphs (Q6041548) (← links)
