Longest paths through an arc in strong semicomplete multipartite digraphs
type: Item
instance of: scholarly article
title: Longest paths through an arc in strong semicomplete multipartite digraphs
zbMATH Open document ID: 1010.05043
DOI: 10.1016/S0012-365X(02)00401-6
author: Lutz Volkmann
published in: Discrete Mathematics
publication date: 2002-12-02T00:00:00Z
review text: 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.
reviewed by: G. Gutin
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1839039
MaRDI profile type: Publication
full work available at URL: s0012-365x(02)00401-6
OpenAlex ID: W2061800650
Recommended article: Longest paths in semicomplete multipartite digraphs
Recommended article: Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Recommended article: Q4488563
Recommended article: A note on longest paths in circular arc graphs
Recommended article: Finding a Longest Path in a Complete Multipartite Digraph
Recommended article: Longest Paths in Circular Arc Graphs
Recommended article: The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
Recommended article: Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
Recommended article: Arc-disjoint paths in decomposable digraphs
description: scientific article; zbMATH DE number 1839039