On Restricted Two-Factors
From MaRDI portal
Publication:3825107
DOI10.1137/0401046zbMath0672.05065OpenAlexW1995435632MaRDI QIDQ3825107
Jan Kratochvíl, Igor Kriz, David G. Kirkpatrick, Pavol Hell
Publication date: 1988
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0401046
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items
An overview of graph covering and partitioning ⋮ Network-Based Dissolution ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ On the complexity of trial and error for constraint satisfaction problems ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity ⋮ A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs ⋮ Minimum-Weight Cycle Covers and Their Approximability ⋮ The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Polyhedron of triangle-free simple 2-matchings in subcubic graphs ⋮ Packing bipartite graphs with covers of complete bipartite graphs ⋮ Compatible 2-factors ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ Finding maximum square-free 2-matchings in bipartite graphs ⋮ Minimum-weight cycle covers and their approximability ⋮ Generalized partitions of graphs ⋮ Network-Based Vertex Dissolution ⋮ Disconnected 2-factors in planar cubic bridgeless graphs
