Outpaths in semicomplete multipartite digraphs
type: Item
instance of: scholarly article
title: Outpaths in semicomplete multipartite digraphs
zbMATH Open document ID: 0934.05071
DOI: 10.1016/S0166-218X(99)00080-3
author: Yubao Guo
published in: Discrete Applied Mathematics
publication date: 2000-04-10T00:00:00Z
review text: An outpath in a digraph is a directed path in which the first vertex \(x\) of the path dominates the last vertex \(z\) of the path only if \(z\) also dominates \(x\). The author shows that if \(x\) is any vertex of a strongly connected semicomplete \(n\)-partite digraph where \(n\geq 3\), then there is an outpath of length \(k\) starting at \(x\) for each \(k\) such that \(2\leq k\leq n-1\). He also shows that if \(xy\) is any arc of a regular \(n\)-partite tournament where \(n\geq 3\), then there is an outpath of length \(k\) starting at \(xy\) for each \(k\) such that \(2\leq k\leq n-1\).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1340641
zbMATH Keywords: semicomplete multipartite digraphs
zbMATH Keywords: outpath
zbMATH Keywords: digraph
zbMATH Keywords: tournament
reviewed by: J. W. Moon
MaRDI profile type: Publication
full work available at URL: s0166-218x(99)00080-3
OpenAlex ID: W2037123402
description: scientific article; zbMATH DE number 1340641