Longest paths through an arc in strong semicomplete multipartite digraphs (Q1850069): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(02)00401-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061800650 / rank | |||
Normal rank | |||
Latest revision as of 12:03, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest paths through an arc in strong semicomplete multipartite digraphs |
scientific article |
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
