Almost regular multipartite tournaments containing a Hamiltonian path through a given arc

DOI10.1016/j.disc.2004.04.009zbMath1047.05021MaRDI QIDQ1877670

Stefan Winzen, Lutz Volkmann

Publication date: 19 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.04.009

zbMATH Keywords

multipartite tournaments; Hamiltonian path; almost regular multipartite tournaments

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

Complementary cycles in regular multipartite tournaments, where one cycle has length five, Complementary cycles in irregular multipartite tournaments, Complementary cycles in almost regular multipartite tournaments, where one cycle has length four, Multipartite tournaments: a survey, Semicomplete Multipartite Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles in multipartite tournaments: Results and problems
• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
• On \(k\)-strong and \(k\)-cyclic digraphs
• Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
• Hamiltonian paths containing a given arc, in almost regular bipartite tournaments
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
• Long paths and cycles in oriented graphs
• One-diregular subgraphs in semicomplete multipartite digraphs
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Kings in semicomplete multipartite digraphs
• Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic