Packing cycles in graphs, II

Authors:
Guoli Ding;Zhenzhen Xu;Wenan Zang
Affiliations:
Mathematics Department, Louisiana State University, Baton Rouge, LA;Department of Mathematics, The University of Hong Kong, Hong Kong, China;Department of Mathematics, The University of Hong Kong, Hong Kong, China
Venue:
Journal of Combinatorial Theory Series B
Year:
2003

Citing 5
Cited 4

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
Packing cycles in graphs

Journal of Combinatorial Theory Series B
A Min-Max Theorem on Feedback Vertex Sets

Mathematics of Operations Research

A Min-Max Relation on Packing Feedback Vertex Sets

Mathematics of Operations Research
A min-max relation on packing feedback vertex sets

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An efficient algorithm for finding maximum cycle packings in reducible flow graphs

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Packing cycles exactly in polynomial time

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph G packs if for every induced subgraph H of G, the maximum number of vertex-disjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack.