Semicomplete Multipartite Digraphs
From MaRDI portal
Recommendations
- Semi-Complete Factorizations of Graphs
- Semicomplete compositions of digraphs
- On ideal semicomplete digraphs
- Degree constrained 2-partitions of semicomplete digraphs
- On the Seidel integral complete multipartite graphs
- Complete subgraphs in multipartite graphs
- Semi-complementary graphs
- Integral complete multipartite graphs
- Integral complete multipartite graphs
- In-tournaments and semicomplete multipartite digraphs
Cites work
- \(k\)-colored kernels
- 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 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 multipartite tournaments containing a Hamiltonian path through a given arc
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- Complementary cycles of all lengths in tournaments
- Cycles and paths in bipartite tournaments with spanning configurations
- Cycles and paths of many lengths in bipartite digraphs
- Cycles containing a given arc in regular multipartite tournaments
- Cycles in bipartite tournaments
- Cycles in multipartite tournaments
- Cycles in multipartite tournaments: Results and problems
- Diconnected Orientations and a Conjecture of Las Vergnas
- Digraphs
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
- Extendable cycles in multipartite tournaments
- Finding a Longest Path in a Complete Multipartite Digraph
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
- Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments
- Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
- Hamiltonian dicycles 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
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- 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 3859163 (Why is no real title available?)
- scientific article; zbMATH DE number 3878956 (Why is no real title available?)
- scientific article; zbMATH DE number 4047757 (Why is no real title available?)
- scientific article; zbMATH DE number 4103112 (Why is no real title available?)
- scientific article; zbMATH DE number 3717351 (Why is no real title available?)
- scientific article; zbMATH DE number 54800 (Why is no real title available?)
- scientific article; zbMATH DE number 123398 (Why is no real title available?)
- scientific article; zbMATH DE number 4127237 (Why is no real title available?)
- scientific article; zbMATH DE number 3013308 (Why is no real title available?)
- scientific article; zbMATH DE number 2104714 (Why is no real title available?)
- scientific article; zbMATH DE number 804599 (Why is no real title available?)
- scientific article; zbMATH DE number 867712 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- In-tournaments and semicomplete multipartite digraphs
- Kings in \(k\)-partite tournaments
- Kings in multipartite tournaments
- Kings in semicomplete multipartite digraphs
- Long paths and cycles in oriented graphs
- Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
- Longest paths through an arc in strong semicomplete multipartite digraphs
- Multipartite tournaments: a survey
- 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 through a given vertex in multipartite tournaments
- On multipartite tournaments
- On Subtournaments of a Tournament
- On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
- On the connectivity of close to regular multipartite tournaments
- One-diregular subgraphs in semicomplete multipartite digraphs
- Orientations of digraphs almost preserving diameter
- Outpaths in semicomplete multipartite digraphs
- Paths and cycles containing given arcs, in close to regular multipartite tournaments
- Quasi-hamiltonian paths in semicomplete multipartite digraphs
- Semicomplete Multipartite Digraphs
- Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
- Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
- Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
- The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
- The number of kings in a multipartite tournament
- The radii of n-partite tournaments
- Three supplements to Reid's theorem in multipartite tournaments
- Weakly Hamiltonian-connected ordinary multipartite tournaments
- When n-cycles in n-partite tournaments are longest cycles
Cited in
(15)- Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
- Oriented bipartite graphs and the Goldbach graph
- Vertex-disjoint cycles of different lengths in multipartite tournaments
- The shifted Turán sieve method on tournaments. II
- Pancyclicity in strong k-quasi-transitive digraphs of large diameter
- Spanning multipartite tournaments of semicomplete multipartite digraphs.
- Semicomplete Multipartite Digraphs
- scientific article; zbMATH DE number 4202276 (Why is no real title available?)
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- scientific article; zbMATH DE number 6117026 (Why is no real title available?)
- scientific article; zbMATH DE number 7324127 (Why is no real title available?)
- Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
- Vertex-disjoint cycles of different lengths in local tournaments
- The niche graphs of multipartite tournaments
This page was built for publication: Semicomplete Multipartite Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120439)
