Pages that link to "Item:Q3201091"
From MaRDI portal
The following pages link to Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments (Q3201091):
Displaying 6 items.
- Polynomial time recognition and testing of isomorphism of cyclic tournaments (Q1190955) (← links)
- Cycles through \(k\) vertices in bipartite tournaments (Q1330800) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Cycles and paths in bipartite tournaments with spanning configurations (Q1823256) (← links)
- (Q4262220) (← links)
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (Q6055389) (← links)