科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 set T subset of V (H) such that H\T is acyclic.
- 出版日期2011-11
