The following pages link to On Restricted Two-Factors (Q3825107):
Displaying 20 items.
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Compatible 2-factors (Q1193724) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Disconnected 2-factors in planar cubic bridgeless graphs (Q1850589) (← links)
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
