When all directed cycles have length three

DOI10.1016/J.EJC.2025.104161MaRDI QIDQ6976296zbMATH OpenFDO

Authors Paul Seymour

Publication date 2 June 2025

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104161

zbMATH Keywords

acyclic digraphThomassen's theorem

Mathematics Subject Classification ID

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

Cites work

• 2-linked graphs
• Characterization of even directed graphs
• Disjoint paths in graphs
• Graph minors. IX: Disjoint crossed paths
• The 2-linkage problem for acyclic digraphs

This page was built for publication: When all directed cycles have length three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6976296)