Two Approximation Algorithms for 3-Cycle Covers
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Computing Cycle Covers without Short Cycles
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Restricted b-matchings in degree-bounded graphs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
The 2-factor problem is to find, in an undirected graph, a spanning subgraph whose components are all simple cycles; hence it is a relaxation of the problem of finding a Hamilton tour in a graph. In this paper we study, in bipartite graphs, a problem of intermediate difficulty: the problem of finding a 2-factor that contains no 4-cycles. We introduce a polynomial time algorithm for this problem; we also present an "augmenting path" theorem, a polyhedral characterization, and a "Tutte-type" characterization of the bipartite graphs that contain such 2-factors.