Semicomplete Multipartite Digraphs
From MaRDI portal
Publication:3120439
DOI10.1007/978-3-319-71840-8_7zbMath1407.05117OpenAlexW2809619683MaRDI QIDQ3120439
Publication date: 4 March 2019
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_7
Related Items (8)
Vertex-disjoint cycles of different lengths in multipartite tournaments ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Vertex-disjoint cycles of different lengths in local tournaments ⋮ The shifted Turán sieve method on tournaments. II ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Oriented bipartite graphs and the Goldbach graph ⋮ Semicomplete Multipartite Digraphs ⋮ Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths
Cites Work
- 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
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
- \(k\)-colored kernels
- The radii of n-partite tournaments
- Complementary cycles of all lengths in tournaments
- Cycles and paths of many lengths in bipartite digraphs
- Three supplements to Reid's theorem in multipartite tournaments
- Hamiltonian dicycles avoiding prescribed arcs in tournaments
- Cycles in bipartite tournaments
- On multipartite tournaments
- Kings in \(k\)-partite tournaments
- On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
- Outpaths in semicomplete multipartite digraphs
- Cycles in multipartite tournaments
- 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
- Cycles containing a given arc in regular multipartite tournaments
- Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
- Orientations of digraphs almost preserving diameter
- When \(n\)-cycles in \(n\)-partite tournaments are longest cycles
- 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
- 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
- Extendable cycles in multipartite tournaments
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- Kings in multipartite tournaments
- Number of 4-kings in bipartite tournaments with no 3-kings
- Quasi-hamiltonian paths in semicomplete multipartite digraphs
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
- Paths and cycles containing given arcs, in close to regular multipartite tournaments
- Multipartite tournaments: a survey
- On the connectivity of close to regular multipartite tournaments
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
- On \(n\)-partite tournaments with unique \(n\)-cycle
- The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs
- Semicomplete Multipartite Digraphs
- On arc-traceable tournaments
- 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
- One-diregular subgraphs in semicomplete multipartite digraphs
- Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
- Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
- 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
- A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
- Kings in semicomplete multipartite digraphs
- Digraphs
- On Subtournaments of a Tournament
- 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
This page was built for publication: Semicomplete Multipartite Digraphs
