General factors of graphs
From MaRDI portal
Recommendations
- Factors and factorization of graphs
- scientific article; zbMATH DE number 874568
- scientific article; zbMATH DE number 5064167
- Factorizations of properties of graphs
- scientific article; zbMATH DE number 3904628
- Factors of regular graphs
- scientific article; zbMATH DE number 3869380
- scientific article; zbMATH DE number 3981221
- On the existence of general factors in regular graphs
- Some remarks about factors of graphs
Cites work
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A Short Proof of the Factor Theorem for Finite Graphs
- Antifactors of graphs
- Matching theory
- Matching, Euler tours and the Chinese postman
- Packing subgraphs in a graph
- Planar 3DM is NP-complete
- Subgraphs with prescribed valencies
- The Factors of Graphs
- The factorization of graphs. II
Cited in
(41)- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- A Tutte-type characterization for graph factors
- Elementary graphs with respect to \(f\)-parity factors
- Graph orientation with edge modifications
- On degree sequence optimization
- \(\{0, 2 \}\)-degree free spanning forests in graphs
- On the Complexity of Holant Problems
- Approximation and exact algorithms for special cases of connected \(f\)-factors
- The membership problem in jump systems
- Popular and clan-popular \(b\)-matchings
- Win-win kernelization for degree sequence completion problems
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
- Editing graphs to satisfy degree constraints: a parameterized approach
- A note on \({\mathtt V}\)-free 2-matchings
- Structure theorem and algorithm on \((1,f)\)-odd subgraph
- Good characterizations for some degree constrained subgraphs
- On caterpillar factors in graphs
- Antifactors of regular bipartite graphs
- A characterization of graphs having all (g,f)-factors
- Optimization over degree sequences of graphs
- On Cui-Kano's characterization problem on graph factors
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
- Tractable cases of the extended global cardinality constraint
- Characterization of 1-tough graphs using factors
- On specific factors in graphs
- The nonnegative node weight \(j\)-restricted \(k\)-matching problems
- Optimal general factor problem and jump system intersection
- Graph editing to a given degree sequence
- An extension of Cui-Kano's characterization on graph factors
- Graph editing to a given degree sequence
- Degree sequence optimization in bounded treewidth
- Structural properties of matroid matchings
- An alternative proof of general factor structure theorem
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
- Matchings with lower quotas: algorithms and complexity
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints
- The Simple Reachability Problem in Switch Graphs
- An algorithmic study of switch graphs
- Packing $k$-Matchings and $k$-Critical Graphs
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- Graph editing problems with extended regularity constraints
This page was built for publication: General factors of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085185)
