Pages that link to "Item:Q3990618"
From MaRDI portal
The following pages link to A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs (Q3990618):
Displaying 16 items.
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Directed circuits on a torus (Q1180428) (← links)
- Antidirected Hamiltonian paths between specified vertices of a tournament (Q1348380) (← links)
- Cycles of all lengths in arc-3-cyclic semicomplete digraphs (Q1367024) (← links)
- Weakly hamiltonian-connected vertices in bipartite tournaments (Q1892846) (← links)
- Quasi-hamiltonian paths in semicomplete multipartite digraphs (Q1949094) (← links)
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) (Q2424662) (← links)
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038) (← links)
- (Q3115591) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916) (← links)
- Spanning eulerian subdigraphs in semicomplete digraphs (Q6046690) (← links)
- Good orientations of unions of edge‐disjoint spanning trees (Q6055412) (← links)
- Detours in directed graphs (Q6113279) (← links)
- NC algorithms for antidirected hamiltonian paths and cycles in tournaments (Q6184385) (← links)
- Strong arc decompositions of split digraphs (Q6642512) (← links)