A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

DOI10.1016/0012-365X(95)00272-XzbMath0870.05046OpenAlexW2069552017MaRDI QIDQ1356402

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

Publication date: 17 September 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00272-x

zbMATH Keywords

pathsdigraphHamiltoniancyclesfactormultipartite tournament

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc ⋮ Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs ⋮ On \(k\)-strong and \(k\)-cyclic digraphs ⋮ Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor ⋮ Semicomplete compositions of digraphs ⋮ Multipartite tournaments: a survey ⋮ Weakly Hamiltonian-connected ordinary multipartite tournaments ⋮ Semicomplete Multipartite Digraphs

Cites Work

• A linear-time algorithm for finding Hamiltonian cycles in tournaments
• Cycles and paths in bipartite tournaments with spanning configurations
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• Diconnected Orientations and a Conjecture of Las Vergnas
• One-diregular subgraphs in semicomplete multipartite digraphs
• Finding a Longest Path in a Complete Multipartite Digraph
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian