Destroying cycles in digraphs

DOI10.1007/S00493-011-2589-4MaRDI QIDQ653984zbMATH OpenOpenAlexFDO

Authors Molly Dunkum, Peter Hamburger, Attila Pór

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

digraphscyclesacyclic, 3-free digraph

Mathematics Subject Classification ID

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

Recommendations

• Destroying longest cycles in graphs and digraphs
• Cycle decompositions of complete digraphs
• Decompositions of digraphs into paths and cycles
• Cyclically decomposing the complete graph into cycles
• Cycles in dense digraphs
• On removable cycles in graphs and digraphs
• Cycle decompositions of complete graphs
• Consistent cycles in graphs and digraphs
• Decomposing various graphs into short even-length cycles
• Publication:4726282

Cites work

• Cycles in dense digraphs
• Directed graphs without short cycles
• On directed triangles in digraphs

Cited in

(4)

• Packing arc-disjoint cycles in oriented graphs
• Turán number of 3-free strong digraphs with out-degree restriction
• 3-free strong digraphs with the maximum size
• On Sullivan's conjecture on cycles in 4-free and 5-free digraphs

This page was built for publication: Destroying cycles in digraphs

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