Finding complementary cycles in locally semicomplete digraphs

DOI10.1016/J.DAM.2004.10.002zbMath1055.05086OpenAlexW2072602713MaRDI QIDQ1763478

Morten Hegner Nielsen, Jörgen Bang-Jensen

Publication date: 22 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.10.002

zbMATH Keywords

Polynomial algorithmSemicomplete digraph2-Cycle factorComplementary cyclesLocally semicomplete digraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Minimum cycle factors in quasi-transitive digraphs ⋮ Degree constrained 2-partitions of semicomplete digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Locally Semicomplete Digraphs and Generalizations

Cites Work

• Unnamed Item
• Unnamed Item
• Complementary cycles of all lengths in tournaments
• Minimum cycle factors in quasi-transitive digraphs
• On complementary cycles in locally semicomplete digraphs
• The partition of a strong tournament
• Locally semicomplete digraphs: A generalization of tournaments

This page was built for publication: Finding complementary cycles in locally semicomplete digraphs