Packing cycles in graphs

DOI10.1006/jctb.2002.2134zbMath1024.05047OpenAlexW2001669390MaRDI QIDQ1403928

Guoli Ding, Wenan Zang

Publication date: 20 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a978dfef237d6c16af6e0c9798a4a069105d7e15

zbMATH Keywords

forbidden structurescycle Mengerian

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (12)

On the feedback vertex set polytope of a series-parallel graph ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Packing cycles exactly in polynomial time ⋮ Packing cycles in graphs. II ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Packing directed circuits exactly ⋮ Ranking tournaments with no errors. II: Minimax relation ⋮ Packing disjoint cycles over vertex cuts ⋮ Ranking tournaments with no errors. I: Structural description ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ On ideal semicomplete digraphs ⋮ When Is the Matching Polytope Box-Totally Dual Integral?

Cites Work

• Geometric algorithms and combinatorial optimization
• On two minimax theorems in graph
• The matroids with the max-flow min-cut property
• On Independent Circuits Contained in a Graph
• Characterizations of derived graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing cycles in graphs