Finding complementary cycles in locally semicomplete digraphs
type: Item
instance of: scholarly article
title: Finding complementary cycles in locally semicomplete digraphs
zbMATH Open document ID: 1055.05086
author: Morten H. Nielsen
author: Jørgen Bang-Jensen
published in: Discrete Applied Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2136335
zbMATH Keywords: Complementary cycles
zbMATH Keywords: 2-Cycle factor
zbMATH Keywords: Locally semicomplete digraph
zbMATH Keywords: Semicomplete digraph
zbMATH Keywords: Polynomial algorithm
MaRDI profile type: MaRDI publication profile
full work available at URL: j.dam.2004.10.002
OpenAlex ID: W2072602713
cites work: Locally semicomplete digraphs: A generalization of tournaments
cites work: Q4500916
cites work: Minimum cycle factors in quasi-transitive digraphs
cites work: On complementary cycles in locally semicomplete digraphs
cites work: The partition of a strong tournament
cites work: Q3691764
cites work: Complementary cycles of all lengths in tournaments
DOI: 10.1016/J.DAM.2004.10.002
Recommended article: LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
Recommended article: On complementary cycles in locally semicomplete digraphs
Recommended article: Locally Semicomplete Digraphs and Generalizations
Recommended article: Restricted cycle factors and arc-decompositions of digraphs
Recommended article: Locally semicomplete digraphs that are complementarym-pancyclic
description: scientific article; zbMATH DE number 2136335