Packing cycles in graphs. II

DOI10.1016/S0095-8956(02)00007-2zbMath1024.05048MaRDI QIDQ1405116

Wenan Zang, Guoli Ding, Zhenzhen Xu

Publication date: 25 August 2003

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

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items

König graphs for 3-paths and 3-cycles ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Packing cycles exactly in polynomial time ⋮ On König graphs with respect to P4 ⋮ Ranking tournaments with no errors. II: Minimax relation ⋮ Ranking tournaments with no errors. I: Structural description ⋮ König Graphs with Respect to the 4-Path and Its Spanning Supergraphs

Cites Work

• Unnamed Item
• Packing directed circuits exactly
• On two minimax theorems in graph
• Packing cycles in graphs
• Packing circuits in eulerian digraphs
• An Approximation Algorithm for Feedback Vertex Sets in Tournaments
• A Minimax Theorem for Directed Graphs
• A Min-Max Theorem on Feedback Vertex Sets