A counterexample to a generalization of Richardson's theorem

DOI10.1016/0012-365X(87)90064-1zbMath0613.05025OpenAlexW2003191035WikidataQ124799721 ScholiaQ124799721MaRDI QIDQ1088675

Adolfo Sánchez-Flores

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90064-1

zbMATH Keywords

digraphRichardson's theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On the complexity of the 3-kernel problem in some classes of digraphs ⋮ On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A counterexample to a generalization of Richardson's theorem