Semicomplete Multipartite Digraphs (Q3120439)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Semicomplete Multipartite Digraphs	scientific article

Statements

scholarly article

0 references

Semicomplete Multipartite Digraphs (English)

0 references

0 references

Springer Monographs in Mathematics

0 references

publication date

4 March 2019

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-71840-8_7

0 references

Cycles and paths of many lengths in bipartite digraphs

0 references

0 references

On the complexity of hamiltonian path and cycle problems in certain classes of digraphs

0 references

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

0 references

Weakly Hamiltonian-connected ordinary multipartite tournaments

0 references

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

0 references

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

0 references

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

0 references

On \(k\)-strong and \(k\)-cyclic digraphs

0 references

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

0 references

Quasi-hamiltonian paths in semicomplete multipartite digraphs

0 references

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs

0 references

0 references

Cycles in bipartite tournaments

0 references

Diconnected Orientations and a Conjecture of Las Vergnas

0 references

On arc-traceable tournaments

0 references

0 references

Hamiltonian dicycles avoiding prescribed arcs in tournaments

0 references

\(k\)-colored kernels

0 references

On multipartite tournaments

0 references

0 references

0 references

Outpaths in semicomplete multipartite digraphs

0 references

On cycles through a given vertex in multipartite tournaments

0 references

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian

0 references

Cycles in multipartite tournaments

0 references

Extendable cycles in multipartite tournaments

0 references

0 references

Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs

0 references

0 references

Finding a Longest Path in a Complete Multipartite Digraph

0 references

0 references

The radii of n-partite tournaments

0 references

Almost minimum diameter orientations of semicomplete multipartite and extended digraphs

0 references

When \(n\)-cycles in \(n\)-partite tournaments are longest cycles

0 references

On \(n\)-partite tournaments with unique \(n\)-cycle

0 references

Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs

0 references

Kings in semicomplete multipartite digraphs

0 references

Orientations of digraphs almost preserving diameter

0 references

Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs

0 references

Cycles and paths in bipartite tournaments with spanning configurations

0 references

Long paths and cycles in oriented graphs

0 references

Kings in multipartite tournaments

0 references

Number of 4-kings in bipartite tournaments with no 3-kings

0 references

The number of kings in a multipartite tournament

0 references

Three supplements to Reid's theorem in multipartite tournaments

0 references

Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs

0 references

On Subtournaments of a Tournament

0 references

0 references

0 references

Kings in \(k\)-partite tournaments

0 references

0 references

0 references

Complementary cycles of all lengths in tournaments

0 references

0 references

Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic

0 references

All regular multipartite tournaments that are cycle complementary

0 references

Cycles in multipartite tournaments: Results and problems

0 references

Hamiltonian paths containing a given arc, in almost regular bipartite tournaments

0 references

Longest paths through an arc in strong semicomplete multipartite digraphs

0 references

Multipartite tournaments: a survey

0 references

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc

0 references

On the connectivity of close to regular multipartite tournaments

0 references

Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments

0 references

0 references

0 references

A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph

0 references

Diregularc-partite tournaments are vertex-pancyclic whenc ? 5

0 references

Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments

0 references

How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?

0 references

One-diregular subgraphs in semicomplete multipartite digraphs

0 references

Paths and cycles containing given arcs, in close to regular multipartite tournaments

0 references

Semicomplete Multipartite Digraphs

0 references

0 references

0 references

Cycles containing a given arc in regular multipartite tournaments

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-71840-8_7

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3120439

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3120439&oldid=36476667"