Longest paths in semicomplete multipartite digraphs

DOI10.1016/S0012-365X(98)00301-XzbMath0928.05036OpenAlexW2068894802MaRDI QIDQ1297460

Lutz Volkmann

Publication date: 9 August 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00301-x

zbMATH Keywords

longest cyclelongest pathssemicomplete multipartite digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Multipartite tournaments: a survey ⋮ When \(n\)-cycles in \(n\)-partite tournaments are longest cycles ⋮ Design of test inputs and their sequences in multi-function system testing ⋮ Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments

This page was built for publication: Longest paths in semicomplete multipartite digraphs