Weakly Hamiltonian-connected ordinary multipartite tournaments

DOI10.1016/0012-365X(94)00188-OzbMath0834.05027MaRDI QIDQ1842145

Gregory Gutin, Jing Huang, Jörgen Bang-Jensen

Publication date: 10 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00188-o

zbMATH Keywords

Hamilton path; multipartite tournament

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Linkages in locally semicomplete digraphs and quasi-transitive digraphs, Paths and cycles in extended and decomposable digraphs, Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs, Quasi-hamiltonian paths in semicomplete multipartite digraphs, Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments, Multipartite tournaments: a survey, Trail-connected tournaments, Semicomplete Multipartite Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• Hamiltonian-connected tournaments
• On the structure of locally semicomplete digraphs
• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
• Kings in quasi-transitive digraphs
• On the structure of local tournaments
• Weakly hamiltonian-connected vertices in bipartite tournaments
• Locally semicomplete digraphs: A generalization of tournaments
• Finding a Longest Path in a Complete Multipartite Digraph
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Quasi‐transitive digraphs