On Restricted Two-Factors
From MaRDI portal
Recommendations
Cited in
(26)- Minimum-weight cycle covers and their approximability
- Compatible 2-factors
- Generalized partitions of graphs
- On the complexity of trial and error for constraint satisfaction problems
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Disconnected 2-factors in planar cubic bridgeless graphs
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- An overview of graph covering and partitioning
- Restricted cycle factors and arc-decompositions of digraphs
- Gadget classification
- Packing bipartite graphs with covers of complete bipartite graphs
- Finding maximum square-free 2-matchings in bipartite graphs
- A greedy algorithm for the social golfer and the Oberwolfach problem
- Network-based dissolution
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
- Minimum-Weight Cycle Covers and Their Approximability
- Packing $k$-Matchings and $k$-Critical Graphs
- Network-based vertex dissolution
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices
- Finding triangle-free 2-factors in general graphs
- Approximation algorithms for non-sequential star packing problems
- Approximation algorithms for the k^+-star packing problem
- Approximation algorithms for non-sequential star packing problems
- Graph factors and factorization: 1985--2003: a survey
- Two-factors in orientated graphs with forbidden transitions
This page was built for publication: On Restricted Two-Factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3825107)
