In-tournament digraphs
type: Item
instance of: scholarly article
title: In-tournament digraphs
zbMATH Open document ID: 0794.05033
author: Jing Huang
author: Erich Prisner
author: Jørgen Bang-Jensen
published in: Journal of Combinatorial Theory. Series B
publication date: 1994-08-17T00:00:00Z
review text: We introduce a generalization of digraphs that are local tournaments. This is the class of in-tournament digraphs---the set of predecessors of every vertex induces a tournament. We show that many properties of local tournament digraphs can be extended even to in-tournament digraphs. For instance, any strongly connected in-tournament digraph has a directed Hamiltonian cycle. We prove that the underlying graph of any in- tournament digraph is 1-homotopic. We investigate the problem of which graphs are orientable as in-tournament digraphs and prove that any graph representable as an intersection subgraph of a unicyclic graph can be so oriented. It is shown that there is a polynomial algorithm for recognizing those graphs that can be oriented as in-tournament digraphs.
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 562421
zbMATH Keywords: linegraphs
zbMATH Keywords: paths
zbMATH Keywords: cycles
zbMATH Keywords: in-tournament digraphs
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: polynomial algorithm
reviewed by: Jørgen Bang-Jensen
MaRDI profile type: Publication
full work available at URL: jctb.1993.1069
OpenAlex ID: W1972280932
DOI: 10.1006/JCTB.1993.1069
description: scientific article; zbMATH DE number 562421