Destroying cycles in digraphs

DOI10.1007/s00493-011-2589-4zbMath1249.05163OpenAlexW2078309664MaRDI QIDQ653984

Molly Dunkum, Attila Pór, Peter Hamburger

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2589-4

zbMATH Keywords

cyclesdigraphsacyclic, 3-free digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Packing arc-disjoint cycles in oriented graphs ⋮ On Sullivan's conjecture on cycles in 4-free and 5-free digraphs ⋮ Counting flags in triangle-free digraphs ⋮ 3-free strong digraphs with the maximum size

Cites Work

• Cycles in dense digraphs
• On directed triangles in digraphs
• Directed Graphs Without Short Cycles

This page was built for publication: Destroying cycles in digraphs