A Min-Max Relation on Packing Feedback Vertex Sets

References

• Bondy J. A., Murty U. S. R.Graph Theory with Applications (1976) (Elsevier Science Publishers, New York) Crossref, Google Scholar
• Cornuéjols G.Combinatorial Optimization: Packing and Covering (2001) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Ding G., Zang W. Packing cycles in graphs. J. Combin. Theory Ser. B (2002) 86:381–407Crossref, Google Scholar
• Ding G., Xu Z., Zang W. Packing cycles in graphs, II. J. Combin. Theory Ser. B (2003) 87:244–253Crossref, Google Scholar
• Edmonds J., Giles R. A min-max relation for submodular functions on graphs. Ann. Discrete Math. (1977) 1:185–204Crossref, Google Scholar
• Lehman A. On the length-width inequality. Math. Programming (1979) 17:403–417Crossref, Google Scholar
• Schrijver A.Combinatorial Optimization—Polyhedra and Efficiency (2003) (Springer-Verlag, Berlin, Germany) Google Scholar