Multipartite tournaments: a survey
From MaRDI portal
Publication:2463897
A multipartite tournament is an oriented complete \(c\)-partite graph for some \(c\geq 2\). This survey, containing 181 references, concentrates primarily on properties of paths and cycles in \(c\)-partite tournaments, mainly for \(c\geq 3\). Some of the section headings are as follows: Cycles whose length does not exceed the number of partite sets; Cycles through partite sets; Cycles and paths through arcs of all short lengths (i.e., not exceeding the number of partite sets); Long and longest paths and cycles; Hamiltonian cycles and paths; Pancyclic and vertex pancyclic multipartite tournaments; Cycles and path with a given number of vertices from each partite set; Complementary cycles; and Hamiltonian-connectedness.
Recommendations
Cites work
- \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs.
- A complete solution of a problem of Bondy concerning multipartite tournaments
- A note on Hamiltonian circuits
- A note on reducible cycles in multipartite tournaments
- A note on the cardinality of certain classes of unlabeled multipartite tournaments
- A note on vertex pancyclic oriented graphs
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
- A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
- A remark on cycles through an arc in strongly connected multipartite tournaments
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
- All regular multipartite tournaments that are cycle complementary
- Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
- Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
- Almost regular c-partite tournaments contain a strong subtournament of order c when c 5
- Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- Complementary cycles containing a fixed arc in diregular bipartite tournaments
- Complementary cycles in regular multipartite tournaments, where one cycle has length five
- Complementary cycles of all lengths in tournaments
- Cycles and paths in bipartite tournaments with spanning configurations
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- Cycles and paths of many lengths in bipartite digraphs
- Cycles containing a given arc in regular multipartite tournaments
- Cycles in bipartite tournaments
- Cycles in digraphs– a survey
- Cycles in multipartite tournaments
- Cycles in multipartite tournaments: Results and problems
- Cycles of Each Length in Regular Tournaments
- Cycles through \(k\) vertices in bipartite tournaments
- Cycles through a given arc and certain partite sets in almost regular multipartite tournaments
- CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments
- Diconnected Orientations and a Conjecture of Las Vergnas
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
- Extendable cycles in multipartite tournaments
- Finding a Longest Path in a Complete Multipartite Digraph
- Generalizations of tournaments: A survey
- Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments
- Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
- Hamiltonian paths containing a given arc, in almost regular bipartite tournaments
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
- Hamiltonian tournaments with the least number of 3-cycles
- Hamiltonian-connected tournaments
- How close to regular must a multipartite tournament be to secure a given path covering number?
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- Hoàng-Reed conjecture holds for tournaments
- scientific article; zbMATH DE number 3885940 (Why is no real title available?)
- scientific article; zbMATH DE number 3150485 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3878956 (Why is no real title available?)
- scientific article; zbMATH DE number 3914352 (Why is no real title available?)
- scientific article; zbMATH DE number 3952812 (Why is no real title available?)
- scientific article; zbMATH DE number 3991541 (Why is no real title available?)
- scientific article; zbMATH DE number 4101223 (Why is no real title available?)
- scientific article; zbMATH DE number 4101247 (Why is no real title available?)
- scientific article; zbMATH DE number 4103112 (Why is no real title available?)
- scientific article; zbMATH DE number 3675933 (Why is no real title available?)
- scientific article; zbMATH DE number 3717351 (Why is no real title available?)
- scientific article; zbMATH DE number 29720 (Why is no real title available?)
- scientific article; zbMATH DE number 54800 (Why is no real title available?)
- scientific article; zbMATH DE number 91022 (Why is no real title available?)
- scientific article; zbMATH DE number 123398 (Why is no real title available?)
- scientific article; zbMATH DE number 3520431 (Why is no real title available?)
- scientific article; zbMATH DE number 3528261 (Why is no real title available?)
- scientific article; zbMATH DE number 398963 (Why is no real title available?)
- scientific article; zbMATH DE number 4123761 (Why is no real title available?)
- scientific article; zbMATH DE number 4127237 (Why is no real title available?)
- scientific article; zbMATH DE number 1216578 (Why is no real title available?)
- scientific article; zbMATH DE number 1334635 (Why is no real title available?)
- scientific article; zbMATH DE number 1340230 (Why is no real title available?)
- scientific article; zbMATH DE number 1355287 (Why is no real title available?)
- scientific article; zbMATH DE number 536588 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 1156581 (Why is no real title available?)
- scientific article; zbMATH DE number 1156582 (Why is no real title available?)
- scientific article; zbMATH DE number 1933064 (Why is no real title available?)
- scientific article; zbMATH DE number 1463410 (Why is no real title available?)
- scientific article; zbMATH DE number 1500178 (Why is no real title available?)
- scientific article; zbMATH DE number 1782549 (Why is no real title available?)
- scientific article; zbMATH DE number 2145367 (Why is no real title available?)
- scientific article; zbMATH DE number 2147930 (Why is no real title available?)
- scientific article; zbMATH DE number 2147933 (Why is no real title available?)
- scientific article; zbMATH DE number 2147941 (Why is no real title available?)
- scientific article; zbMATH DE number 2148776 (Why is no real title available?)
- scientific article; zbMATH DE number 3013308 (Why is no real title available?)
- scientific article; zbMATH DE number 1833081 (Why is no real title available?)
- scientific article; zbMATH DE number 1850933 (Why is no real title available?)
- scientific article; zbMATH DE number 2104714 (Why is no real title available?)
- scientific article; zbMATH DE number 2114688 (Why is no real title available?)
- scientific article; zbMATH DE number 759635 (Why is no real title available?)
- scientific article; zbMATH DE number 799967 (Why is no real title available?)
- scientific article; zbMATH DE number 843316 (Why is no real title available?)
- scientific article; zbMATH DE number 867712 (Why is no real title available?)
- scientific article; zbMATH DE number 5240517 (Why is no real title available?)
- scientific article; zbMATH DE number 2197943 (Why is no real title available?)
- scientific article; zbMATH DE number 3294297 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- scientific article; zbMATH DE number 969987 (Why is no real title available?)
- scientific article; zbMATH DE number 2222004 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- In-tournaments and semicomplete multipartite digraphs
- Kings in \(k\)-partite tournaments
- Kings in multipartite tournaments
- Kings in semicomplete multipartite digraphs
- Long cycles in bipartite tournaments
- Long paths and cycles in oriented graphs
- Longest cycles in almost regular 3-partite tournaments
- Longest paths in semicomplete multipartite digraphs
- Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
- Longest paths through an arc in strong semicomplete multipartite digraphs
- Minimizing and maximizing the diameter in orientations of graphs
- Minimum cost and list homomorphisms to semicomplete digraphs
- Multipartite tournaments with small number of cycles
- Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs
- Number of 4-kings in bipartite tournaments with no 3-kings
- On \(k\)-strong and \(k\)-cyclic digraphs
- On \(n\)-partite tournaments with unique \(n\)-cycle
- On arc-traceable tournaments
- On cycles containing a given arc in regular multipartite tournaments
- On cycles in multipartite tournaments
- On cycles in regular 3-partite tournaments
- On cycles through a given vertex in multipartite tournaments
- On multipartite tournament matrices with constant team size∗
- On multipartite tournaments
- On Subtournaments of a Tournament
- On the 3-kings and 4-kings in multipartite tournaments
- On the connectivity of close to regular multipartite tournaments
- On the number of noncritical vertices in strongly connected digraphs
- On the path covering number of given subdigraphs of regular multipartite tournaments
- One-diregular subgraphs in semicomplete multipartite digraphs
- Outpaths in semicomplete multipartite digraphs
- Outpaths of arcs in multipartite tournaments
- Pancyclic arcs and connectivity in tournaments
- Pancyclic oriented graphs
- Pancyclic out-arcs of a vertex in 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
- Pushing the cycles out of multipartite tournaments
- Robbins's Theorem for Mixed Multigraphs
- Score sets in \(k\)-partite tournaments
- Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
- Spanning multipartite tournaments of semicomplete multipartite digraphs.
- Strong subtournaments containing a given vertex in regular multipartite tournaments
- Strongly 4-path-connectivity in almost regular multipartite tournaments
- Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
- The average connectivity of regular multipartite tournaments
- The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
- The number of cut vertices and cut arcs in a strong directed graph
- The number of kings in a multipartite tournament
- The number of pancyclic arcs in a k‐strong tournament
- The partition of a strong tournament
- The radii of n-partite tournaments
- The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
- The Theory of Round Robin Tournaments
- Tournaments That Admit Exactly One Hamiltonian Circuit
- Two-path convexity in clone-free regular multipartite tournaments
- Vertex deletion and cycles in multipartite tournaments
- Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
- Weakly Hamiltonian-connected ordinary multipartite tournaments
- Weakly hamiltonian-connected vertices in bipartite tournaments
- When n-cycles in n-partite tournaments are longest cycles
Cited in
(44)- A survey on the complexity of tournament solutions
- Cycles in multipartite tournaments: Results and problems
- A note on the cardinality of certain classes of unlabeled multipartite tournaments
- On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
- Properly edge-colored theta graphs in edge-colored complete graphs
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
- Outpaths of arcs in regular 3-partite tournaments
- Competitively orientable complete multipartite graphs
- The shifted Turán sieve method on tournaments. II
- Quasi-Hamiltonian cycles in k-strong multipartite tournaments
- On the vertices of a 3-partite tournament not in triangles
- Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
- A remark on cycles through an arc in strongly connected multipartite tournaments
- Almost regular c-partite tournaments contain a strong subtournament of order c when c 5
- Strong subtournaments and cycles of multipartite tournaments
- A classification of arc-locally semicomplete digraphs
- Semicomplete Multipartite Digraphs
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
- Notes on cycles through a vertex or an arc in regular 3-partite tournaments
- A classification of all arc-locally semicomplete digraphs
- scientific article; zbMATH DE number 1782549 (Why is no real title available?)
- scientific article; zbMATH DE number 2147941 (Why is no real title available?)
- Cycles through an arc in regular 3-partite tournaments
- scientific article; zbMATH DE number 7641244 (Why is no real title available?)
- Conditions on the regularity of balanced \(c\)-partite tournaments for the existence of strong subtournaments with high minimum degree
- Surprises in Knockout Tournaments
- scientific article; zbMATH DE number 2221997 (Why is no real title available?)
- The radii of n-partite tournaments
- On cycles in regular 3-partite tournaments
- Pushing the cycles out of multipartite tournaments
- Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments
- \(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament
- Cycles through arcs in multipartite tournaments and a conjecture of Volkmann
- Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\)
- A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
- Extensions of Moon's and Bagga and Beineke's theorems on dicycle and score (outdegree) structures of tournaments
- Generalized competitively orientable complete multipartite graphs
- The niche graphs of multipartite tournaments
- Hamiltonian connected balanced multipartite tournaments and Hamiltonian connected partitions
- The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments
- \(\mathrm{Quasi}_{\mathrm{nl}}\)-arc-pancyclic regular multipartite tournaments
- Weakly quasi-Hamiltonian-connected multipartite tournaments
- Three supplements to Reid's theorem in multipartite tournaments
- Strong subtournaments containing a given vertex in regular multipartite tournaments
This page was built for publication: Multipartite tournaments: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463897)
