Hamiltonian paths containing a given arc, in almost regular bipartite tournaments

DOI10.1016/J.DISC.2004.02.016zbMath1054.05066OpenAlexW2009287073MaRDI QIDQ1877685

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.02.016

zbMATH Keywords

Hamiltonian pathsbipartite tournamentsalmost regular multipartite tournamentsalmost regular bipartite tournaments

Mathematics Subject Classification ID

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

Related Items (4)

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc ⋮ A sufficient condition for Hamiltonian cycles in bipartite tournaments ⋮ Multipartite tournaments: a survey ⋮ Semicomplete Multipartite Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles and paths of many lengths in bipartite digraphs
• Cycles in multipartite tournaments: Results and problems
• On cycles through a given vertex in multipartite tournaments
• Cycles and paths in bipartite tournaments with spanning configurations
• Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Kings in semicomplete multipartite digraphs

This page was built for publication: Hamiltonian paths containing a given arc, in almost regular bipartite tournaments