Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs

DOI10.1007/S003730170022zbMATH Open1102.05300OpenAlexW1969741579WikidataQ123356810 ScholiaQ123356810MaRDI QIDQ5952385FDOQ5952385

Authors: G. Gutin, A. Yeo 

Publication date: 2 March 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730170022

Recommendations

• The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
• Finding a Longest Path in a Complete Multipartite Digraph
• Longest paths in semicomplete multipartite digraphs
• Longest paths through an arc in strong semicomplete multipartite digraphs
• Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs

Mathematics Subject Classification ID

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

Cited In (4)

• On optimal orientation of cycle vertex multiplications
• Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
• Multipartite tournaments: a survey
• Semicomplete Multipartite Digraphs

This page was built for publication: Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952385)