The following pages link to General factors of graphs (Q1085185):
Displaying 41 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- An algorithmic study of switch graphs (Q715049) (← links)
- A note on \({\mathtt V}\)-free 2-matchings (Q727204) (← links)
- Structure theorem and algorithm on \((1,f)\)-odd subgraph (Q878634) (← links)
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) (← links)
- Elementary graphs with respect to \(f\)-parity factors (Q968209) (← links)
- Good characterizations for some degree constrained subgraphs (Q1003846) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Structural properties of matroid matchings (Q1199466) (← links)
- A characterization of graphs having all \((g,f)\)-factors (Q1366610) (← links)
- The membership problem in jump systems (Q1369649) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
- Characterization of 1-tough graphs using factors (Q2185904) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- On specific factors in graphs (Q2227979) (← links)
- Popular and clan-popular \(b\)-matchings (Q2250455) (← links)
- \(\{0, 2 \}\)-degree free spanning forests in graphs (Q2339439) (← links)
- Tractable cases of the extended global cardinality constraint (Q2430356) (← links)
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)
- On degree sequence optimization (Q2661577) (← links)
- Optimization over degree sequences of graphs (Q2663988) (← links)
- On Cui-Kano's Characterization Problem on Graph Factors (Q2862548) (← links)
- Approximation and Exact Algorithms for Special Cases of Connected f-Factors (Q3194728) (← links)
- Antifactors of regular bipartite graphs (Q3386611) (← links)
- An Extension of Cui-Kano's Characterization on Graph Factors (Q3466349) (← links)
- The Simple Reachability Problem in Switch Graphs (Q3599094) (← links)
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints (Q3599161) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs (Q5264756) (← links)
- A Tutte-Type Characterization for Graph Factors (Q5267996) (← links)
- Graph Editing to a Given Degree Sequence (Q5740185) (← links)
- Graph Orientation with Edge Modifications (Q5859684) (← links)
- Degree sequence optimization in bounded treewidth (Q6097483) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)
