How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
From MaRDI portal
Publication:1961765
DOI10.1007/s003730050080zbMath0939.05059MaRDI QIDQ1961765
Publication date: 5 July 2000
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050080
Related Items
Diregularc-partite tournaments are vertex-pancyclic whenc ? 5, A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture, Longest cycles in almost regular 3-partite tournaments, Strong subtournaments containing a given vertex in regular multipartite tournaments, Complementary cycles in regular multipartite tournaments, where one cycle has length five, Complementary cycles in irregular multipartite tournaments, All regular multipartite tournaments that are cycle complementary, Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments, Cycles through a given arc and certain partite sets in almost regular multipartite tournaments, 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, Paths with a given number of vertices from each partite set in regular multipartite tournaments, Complementary cycles in almost regular multipartite tournaments, where one cycle has length four, Multipartite tournaments: a survey, Strongly 4-path-connectivity in almost regular multipartite tournaments, Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\), On the connectivity of close to regular multipartite tournaments, Semicomplete Multipartite Digraphs, Cycles with a given number of vertices from each partite set in regular multipartite tournaments
