Kings in semicomplete multipartite digraphs

DOI<177::AID-JGT8>3.0.CO;2-1 10.1002/(SICI)1097-0118(200003)33:3<177::AID-JGT8>3.0.CO;2-1zbMath0944.05053MaRDI QIDQ4948513

Anders Yeo, Gregory Gutin

Publication date: 24 September 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200003)33:3<177::aid-jgt8>3.0.co;2-1

zbMATH Keywords

path; tournaments; multipartite digraphs

Mathematics Subject Classification ID

05C38: Paths and cycles

05C12: Distance in graphs

05C20: Directed graphs (digraphs), tournaments

Related Items

k‐Kings in k‐Quasitransitive Digraphs, On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs, \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs, \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs, Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\), Toppling kings in multipartite tournaments by introducing new kings, Longest cycles in almost regular 3-partite tournaments, Three supplements to Reid's theorem in multipartite tournaments, Strong subtournaments containing a given vertex in regular multipartite tournaments, Complementary cycles in regular multipartite tournaments, where one cycle has length five, The cycle structure of regular multipartite tournaments, On the kings and kings-of-kings in semicomplete multipartite digraphs, 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, 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, On semicomplete multipartite digraphs whose king sets are semicomplete digraphs, On the 3-kings and 4-kings in 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, 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

Cites Work

• The radii of n-partite tournaments