Pages that link to "Item:Q4242916"
From MaRDI portal
The following pages link to A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916):
Displayed 14 items.
- Minimum cycle factors in quasi-transitive digraphs (Q924641) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian (Q1569076) (← links)
- Orientations of digraphs almost preserving diameter (Q1613394) (← links)
- Classification of de Bruijn-based labeled digraphs (Q1686053) (← links)
- Hamiltonian paths containing a given arc, in almost regular bipartite tournaments (Q1877685) (← links)
- Quasi-hamiltonian paths in semicomplete multipartite digraphs (Q1949094) (← links)
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (Q1981705) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- On a cyclic connectivity property of directed graphs (Q2469976) (← links)
- Semicomplete Multipartite Digraphs (Q3120439) (← links)
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments (Q3599911) (← links)
- Sparse Spanning $k$-Connected Subgraphs in Tournaments (Q5361237) (← links)
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (Q6055389) (← links)