Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments

DOI10.1016/j.disc.2003.07.013zbMath1050.05061OpenAlexW2017888452MaRDI QIDQ1827718

Lutz Volkmann, Anders Yeo

Publication date: 6 August 2004

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

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

zbMATH Keywords

Hamilton pathregularmultipartite tournament

Mathematics Subject Classification ID

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

Related Items (6)

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc ⋮ Hamiltonian paths containing a given arc, in almost regular bipartite tournaments ⋮ Paths and cycles containing given arcs, in close to regular multipartite tournaments ⋮ Multipartite tournaments: a survey ⋮ Semicomplete Multipartite Digraphs ⋮ On the vertices of a 3-partite tournament not in triangles

Cites Work

• Cycles and paths of many lengths in bipartite digraphs
• Cycles in multipartite tournaments: Results and problems
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• Paths and cycles containing given arcs, in close to regular multipartite tournaments
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments