Packing directed circuits exactly
classification
🧮 math.CO
cs.DM
keywords
circuitsacycliccardinalitycharacterizationdigraphsdirecteddisjointequal
read the original abstract
We give an "excluded minor" and a "structural" characterization of digraphs D that have the property that for every subdigraph H of D, the maximum number of disjoint circuits in H is equal to the minimum cardinality of a subset T of V(H) such that H\T is acyclic.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.