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

DOI10.1016/j.disc.2004.02.016zbMath1054.05066MaRDI 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 paths; bipartite tournaments; almost regular multipartite tournaments; almost regular bipartite tournaments

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item