Multipartite tournaments: a survey

DOI10.1016/J.DISC.2007.03.053zbMATH Open1134.05033OpenAlexW2031334051MaRDI QIDQ2463897FDOQ2463897

Authors: Lutz Volkmann 

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

Recommendations

• Cycles in multipartite tournaments: Results and problems
• On cycles in multipartite tournaments
• A remark on cycles through an arc in strongly connected multipartite tournaments
• Cycles in multipartite tournaments
• scientific article; zbMATH DE number 867712

zbMATH Keywords

pathsconnectivitycyclespancyclicitycomplementary cyclesmultipartite tournamentsHamiltonian cycles and paths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Hoàng-Reed conjecture holds for tournaments
• Title not available (Why is that?)
• The number of cut vertices and cut arcs in a strong directed graph
• Hamiltonian tournaments with the least number of 3-cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• On arc-traceable tournaments
• Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
• Weakly Hamiltonian-connected ordinary multipartite tournaments
• Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spanning multipartite tournaments of semicomplete multipartite digraphs.
• Cycles through \(k\) vertices in bipartite tournaments
• Title not available (Why is that?)
• Longest paths in semicomplete multipartite digraphs
• Outpaths 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
• The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
• Cycles with a given number of vertices from each partite set in regular multipartite tournaments
• CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS
• Weakly hamiltonian-connected vertices in bipartite tournaments
• A complete solution of a problem of Bondy concerning multipartite tournaments
• Title not available (Why is that?)
• \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs.
• A note on the cardinality of certain classes of unlabeled multipartite tournaments
• Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
• Multipartite tournaments with small number of cycles
• Title not available (Why is that?)
• When \(n\)-cycles in \(n\)-partite tournaments are longest cycles
• On \(n\)-partite tournaments with unique \(n\)-cycle
• Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs
• Title not available (Why is that?)
• Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
• The average connectivity of regular multipartite tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian paths containing a given arc, in almost regular bipartite tournaments
• Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
• How close to regular must a multipartite tournament be to secure a given path covering number?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments
• On multipartite tournament matrices with constant team size^∗
• Outpaths of arcs in multipartite tournaments
• Two-path convexity in clone-free regular 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
• Title not available (Why is that?)
• Cycles and paths in bipartite tournaments with spanning configurations
• The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
• Finding a Longest Path in a Complete Multipartite Digraph
• Title not available (Why is that?)
• A note on Hamiltonian circuits
• Title not available (Why is that?)
• On Subtournaments of a Tournament
• Hamiltonian-connected tournaments
• Title not available (Why is that?)
• The Theory of Round Robin Tournaments
• Title not available (Why is that?)
• Pancyclic out-arcs of a vertex in tournaments
• A remark on cycles through an arc in strongly connected multipartite tournaments
• Pancyclic arcs and connectivity in tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of pancyclic arcs in a k‐strong tournament
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalizations of tournaments: A survey
• Cycles in multipartite tournaments: Results and problems
• On cycles through a given vertex in multipartite tournaments
• Title not available (Why is that?)
• Cycles in bipartite tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kings in \(k\)-partite tournaments
• Vertex deletion and cycles in multipartite tournaments
• On cycles in multipartite tournaments
• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
• The number of kings in a multipartite tournament
• Kings in multipartite tournaments
• Number of 4-kings in bipartite tournaments with no 3-kings
• On the 3-kings and 4-kings in multipartite tournaments
• Robbins's Theorem for Mixed Multigraphs
• Diconnected Orientations and a Conjecture of Las Vergnas
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Title not available (Why is that?)
• Kings in semicomplete multipartite digraphs
• The radii of n-partite tournaments
• Complementary cycles containing a fixed arc in diregular bipartite tournaments
• The partition of a strong tournament
• All regular multipartite tournaments that are cycle complementary
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complementary cycles of all lengths in tournaments
• Cycles and paths of many lengths in bipartite digraphs
• Cycles in digraphs– a survey
• Pancyclic oriented graphs
• Cycles in multipartite tournaments
• Cycles containing a given arc in regular multipartite tournaments
• Cycles through a given arc and certain partite sets in almost regular multipartite tournaments
• On cycles containing a given arc in regular multipartite tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On cycles in regular 3-partite tournaments
• Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
• Paths and cycles containing given arcs, in close to regular multipartite tournaments
• Minimum cost and list homomorphisms to semicomplete digraphs
• Long paths and cycles in oriented graphs
• A note on vertex pancyclic oriented graphs
• One-diregular subgraphs in semicomplete multipartite digraphs
• Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
• Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
• On \(k\)-strong and \(k\)-cyclic digraphs
• Minimizing and maximizing the diameter in orientations of graphs
• Title not available (Why is that?)
• A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
• A note on reducible cycles in multipartite tournaments
• Cycles of Each Length in Regular Tournaments
• Tournaments That Admit Exactly One Hamiltonian Circuit
• Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strong subtournaments containing a given vertex in regular multipartite tournaments
• Complementary cycles in regular multipartite tournaments, where one cycle has length five
• Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• On multipartite tournaments
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
• On the connectivity of close to regular multipartite tournaments
• Extendable cycles in multipartite tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of noncritical vertices in strongly connected digraphs
• In-tournaments and semicomplete multipartite digraphs
• On the path covering number of given subdigraphs of regular multipartite tournaments
• Title not available (Why is that?)
• Score sets in \(k\)-partite tournaments
• Long cycles in bipartite tournaments
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• Title not available (Why is that?)
• Longest cycles in almost regular 3-partite tournaments
• Pushing the cycles out of multipartite tournaments

Cited In (39)

• A remark on cycles through an arc in strongly connected multipartite tournaments
• Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
• Surprises in Knockout Tournaments
• Conditions on the regularity of balanced \(c\)-partite tournaments for the existence of strong subtournaments with high minimum degree
• The shifted Turán sieve method on tournaments. II
• The radii of n-partite tournaments
• Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments
• Properly edge-colored theta graphs in edge-colored complete graphs
• Three supplements to Reid's theorem in multipartite tournaments
• Title not available (Why is that?)
• Cycles through arcs in multipartite tournaments and a conjecture of Volkmann
• Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)
• The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments
• Strong subtournaments and cycles of multipartite tournaments
• A classification of all arc-locally semicomplete digraphs
• Notes on cycles through a vertex or an arc in regular 3-partite tournaments
• A survey on the complexity of tournament solutions
• On cycles in regular 3-partite tournaments
• A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
• On the vertices of a 3-partite tournament not in triangles
• Outpaths of arcs in regular 3-partite tournaments
• Weakly quasi-Hamiltonian-connected multipartite tournaments
• Pushing the cycles out of multipartite tournaments
• Semicomplete Multipartite Digraphs
• Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\)
• Title not available (Why is that?)
• Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
• A classification of arc-locally semicomplete digraphs
• Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments
• Cycles through an arc in regular 3-partite tournaments
• Strong subtournaments containing a given vertex in regular multipartite tournaments
• Title not available (Why is that?)
• Cycles in multipartite tournaments: Results and problems
• Title not available (Why is that?)
• On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
• Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
• Competitively orientable complete multipartite graphs
• A note on the cardinality of certain classes of unlabeled multipartite tournaments
• \(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament

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)