A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

DOI10.1016/0012-365X(95)00272-XzbMATH Open0870.05046OpenAlexW2069552017MaRDI QIDQ1356402FDOQ1356402

Jing Huang, G. 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

pathscyclesdigraphHamiltonianfactormultipartite tournament

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• Title not available (Why is that?)
• Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
• Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
• Multipartite tournaments: a survey
• Semicomplete Multipartite Digraphs
• Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
• Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
• On \(k\)-strong and \(k\)-cyclic digraphs
• Title not available (Why is that?)
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
• Weakly Hamiltonian-connected ordinary multipartite tournaments
• Semicomplete compositions of digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356402)