Longest paths through an arc in strong semicomplete multipartite digraphs (Q1850069)
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: Longest paths through an arc in strong semicomplete multipartite digraphs |
scientific article; zbMATH DE number 1839039
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest paths through an arc in strong semicomplete multipartite digraphs |
scientific article; zbMATH DE number 1839039 |
Statements
Longest paths through an arc in strong semicomplete multipartite digraphs (English)
0 references
2 December 2002
0 references
A digraph obtained by replacing each edge of a complete \(n\)-partite graph by an arc or a pair of mutually opposite arcs is called a semicomplete \(n\)-partite digraph. The author proves that every arc of a semicomplete \(n\)-partite digraph that belongs to an \(\ell\)-cycle \((\ell\geq 3)\) is in a path with at least \(\lceil{n+3\over 2}\rceil\) vertices.
0 references
0.9456908
0 references
0.9302039
0 references
0.89506346
0 references
0.8933848
0 references
0 references
0.88655996
0 references
0.8857271
0 references
0.8818275
0 references
