Multipartite tournaments: a survey
From MaRDI portal
Publication:2463897
DOI10.1016/j.disc.2007.03.053zbMath1134.05033MaRDI QIDQ2463897
Publication date: 6 December 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.053
paths; cycles; connectivity; complementary cycles; multipartite tournaments; pancyclicity; Hamiltonian cycles and paths
Related Items
Unnamed Item, Surprises in Knockout Tournaments, Conditions on the regularity of balanced $c$-partite tournaments for the existence of strong subtournaments with high minimum degree, On cycles in regular 3-partite tournaments, Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments, \(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament, 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, Cycles through an arc in regular 3-partite tournaments, 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\), The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite 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, 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\geqslant 5\), Strong subtournaments and cycles of multipartite tournaments, A classification of arc-locally semicomplete digraphs, Semicomplete Multipartite Digraphs
Cites Work
- The radii of n-partite tournaments
- A note on reducible cycles in multipartite tournaments
- Complementary cycles of all lengths in tournaments
- Score sets in \(k\)-partite tournaments
- Longest cycles in almost regular 3-partite tournaments
- Cycles and paths of many lengths in bipartite digraphs
- Hoàng-Reed conjecture holds for tournaments
- Strong subtournaments containing a given vertex in regular multipartite tournaments
- Complementary cycles in regular multipartite tournaments, where one cycle has length five
- Hamiltonian-connected tournaments
- Cycles in bipartite tournaments
- On multipartite tournaments
- Kings in \(k\)-partite tournaments
- Vertex deletion and cycles in multipartite tournaments
- Longest paths in semicomplete multipartite digraphs
- Outpaths in semicomplete multipartite digraphs
- On cycles in multipartite tournaments
- Cycles through \(k\) vertices in bipartite tournaments
- Complementary cycles containing a fixed arc in diregular bipartite tournaments
- Cycles in multipartite tournaments
- Minimizing and maximizing the diameter in orientations of graphs
- Cycles in multipartite tournaments: Results and problems
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
- The number of kings in a multipartite tournament
- On \(k\)-strong and \(k\)-cyclic digraphs
- On cycles through a given vertex in multipartite tournaments
- \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs.
- Cycles containing a given arc in regular multipartite tournaments
- Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
- A note on the cardinality of certain classes of unlabeled multipartite tournaments
- When \(n\)-cycles in \(n\)-partite tournaments are longest cycles
- The partition of a strong tournament
- Cycles and paths in bipartite tournaments with spanning configurations
- 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
- Weakly Hamiltonian-connected ordinary multipartite tournaments
- Longest paths through an arc in strong semicomplete multipartite digraphs
- Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
- Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
- Hamiltonian paths containing a given arc, in almost regular bipartite tournaments
- On cycles containing a given arc in regular multipartite tournaments
- Extendable cycles in multipartite tournaments
- Weakly hamiltonian-connected vertices in bipartite tournaments
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- A complete solution of a problem of Bondy concerning multipartite tournaments
- Kings in multipartite tournaments
- Long cycles in bipartite tournaments
- Number of 4-kings in bipartite tournaments with no 3-kings
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- Pancyclic out-arcs of a vertex in tournaments
- Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
- Paths and cycles containing given arcs, in close to regular multipartite tournaments
- 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
- Strongly 4-path-connectivity in almost regular multipartite tournaments
- A remark on cycles through an arc in strongly connected multipartite tournaments
- On the number of noncritical vertices in strongly connected digraphs
- Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)
- Minimum cost and list homomorphisms to semicomplete digraphs
- On the connectivity of close to regular multipartite tournaments
- On \(n\)-partite tournaments with unique \(n\)-cycle
- A note on Hamiltonian circuits
- The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs
- Pancyclic arcs and connectivity in tournaments
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs
- Hamiltonian tournaments with the least number of 3-cycles
- On arc-traceable tournaments
- Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments
- Robbins's Theorem for Mixed Multigraphs
- Cycles in digraphs– a survey
- Long paths and cycles in oriented graphs
- Diconnected Orientations and a Conjecture of Las Vergnas
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
- Generalizations of tournaments: A survey
- A note on vertex pancyclic oriented graphs
- Pancyclic oriented graphs
- One-diregular subgraphs in semicomplete multipartite digraphs
- Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
- On multipartite tournament matrices with constant team size∗
- Finding a Longest Path in a Complete Multipartite Digraph
- Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
- Kings in semicomplete multipartite digraphs
- CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS
- On Subtournaments of a Tournament
- The Theory of Round Robin Tournaments
- Cycles of Each Length in Regular Tournaments
- Tournaments That Admit Exactly One Hamiltonian Circuit
- The number of cut vertices and cut arcs in a strong directed graph
- The number of pancyclic arcs in a k‐strong tournament
- On cycles in regular 3-partite tournaments
- Pushing the cycles out of multipartite tournaments
- The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
- Outpaths of arcs in multipartite tournaments
- Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
- Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
