On the number of cycles in local tournaments
type: Item
instance of: scholarly article
title: On the number of cycles in local tournaments
zbMATH Open document ID: 1229.05110
author: Dirk Meierling
author: Lutz Volkmann
published in: Discrete Mathematics
publication date: 2009-06-19T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5566670
zbMATH Keywords: local tournament
zbMATH Keywords: number of cycles
zbMATH Keywords: cut vertex
MaRDI profile type: Publication
full work available at URL: j.disc.2008.04.015
OpenAlex ID: W2075216780
cites work: Locally semicomplete digraphs: A generalization of tournaments
cites work: A classification of locally semicomplete digraphs
cites work: Hamiltonian tournaments with the least number of 3-cycles
cites work: Tournaments That Admit Exactly One Hamiltonian Circuit
cites work: Connectivity properties of locally semicomplete digraphs
cites work: Q5576817
cites work: Q3412126
cites work: Q4100106
cites work: Q5442548
cites work: On Subtournaments of a Tournament
DOI: 10.1016/J.DISC.2008.04.015
description: scientific article; zbMATH DE number 5566670