Pages that link to "Item:Q4939609"
From MaRDI portal
The following pages link to A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph (Q4939609):
Displayed 5 items.
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815) (← links)
- Semicomplete Multipartite Digraphs (Q3120439) (← links)
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (Q6055389) (← links)
