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

DOI10.1016/S0012-365X(00)00055-8zbMath0962.05032OpenAlexW1964296470MaRDI QIDQ1579571

Gregory Gutin, Anders Yeo, Meike Tewes

Publication date: 4 June 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00055-8

zbMATH Keywords

pathspanning subgraphsemicomplete multipartite digraph

Mathematics Subject Classification ID

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

Related Items (3)

Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs ⋮ Multipartite tournaments: a survey ⋮ Semicomplete Multipartite Digraphs

This page was built for publication: Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs