Spanning multipartite tournaments of semicomplete multipartite digraphs. (Q2716022)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Spanning multipartite tournaments of semicomplete multipartite digraphs. |
scientific article; zbMATH DE number 1600988
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning multipartite tournaments of semicomplete multipartite digraphs. |
scientific article; zbMATH DE number 1600988 |
Statements
20 July 2005
0 references
semicomplete \(n\)-partite digraph
0 references
\(n\)-partite tournament
0 references
Spanning multipartite tournaments of semicomplete multipartite digraphs. (English)
0 references
A semicomplete \(n\)-partite digraph is a digraph obtained from an undirected complete \(n\)-partite graph by replacing each edge by an arc or by a pair of opposite arcs. An orientation of a complete \(n\)-partite graph is called an \(n\)-partite tournament. The paper studies the conditions for a strongly connected semicomplete \(n\)-partite digraph to have a spanning subdigraph which is a strongly connected \(n\)-partite tournament.
0 references
