Packing cycles in graphs

DOI10.1006/JCTB.2002.2134MaRDI QIDQ1403928zbMATH OpenOpenAlexFDO

Authors 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

cycle Mengerianforbidden structures

Mathematics Subject Classification ID

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

Recommendations

• Packing cycles in graphs. II
• Packing cycles exactly in polynomial time
• A Min-Max Relation on Packing Feedback Vertex Sets
• Algorithms and Computation
• Cycle packings in graphs and digraphs

Cites work

• Characterizations of derived graphs
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3477226 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On Independent Circuits Contained in a Graph
• On two minimax theorems in graph
• The matroids with the max-flow min-cut property

Cited in

(21)

• Packing circuits in matroids
• Packing cycles in graphs. II
• Ranking tournaments with no errors. II: Minimax relation
• Box-total dual integrality, box-integrality, and equimodular matrices
• Erdős-Pósa property of chordless cycles and its applications
• Packing cycles through prescribed vertices
• Ranking tournaments with no errors. I: Structural description
• On ideal semicomplete digraphs
• Recent techniques and results on the Erdős-Pósa property
• Scattered packings of cycles
• Induced Packing of Odd Cycles in a Planar Graph
• Packing cycles exactly in polynomial time
• Cycle stochastic graphs: structural and forbidden graph characterizations
• On maximum cycle packings in polyhedral graphs
• When is the matching polytope box-totally dual integral?
• Approximability of Packing Disjoint Cycles
• A Min-Max Relation on Packing Feedback Vertex Sets
• Packing directed circuits exactly
• On the feedback vertex set polytope of a series-parallel graph
• Packing directed cycles efficiently
• Packing disjoint cycles over vertex cuts

This page was built for publication: Packing cycles in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403928)