Packing directed circuits exactly

DOI10.1007/s00493-011-1687-5zbMath1299.05144arXiv1012.2749OpenAlexW1964031838MaRDI QIDQ663091

Robin Thomas, Guenin, Bertrand

Publication date: 13 February 2012

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.2749

zbMATH Keywords

strongly connected digraphsminorsmaximum packing of circuitsminimum transversalsstrongly planar digraphs

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Even circuits in oriented matroids ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ Excluding a planar matching minor in bipartite graphs ⋮ Packing cycles in graphs. II ⋮ Ranking tournaments with no errors. II: Minimax relation ⋮ Digraphs of directed treewidth one ⋮ Ranking tournaments with no errors. I: Structural description ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Euler Digraphs ⋮ Colouring non-even digraphs

Cites Work

• Characterization of even directed graphs
• Packing directed circuits
• Packing cycles in graphs
• Pólya's permanent problem
• Permanents, Pfaffian orientations, and even directed circuits
• A Minimax Theorem for Directed Graphs
• A Min-Max Theorem on Feedback Vertex Sets

This page was built for publication: Packing directed circuits exactly