General factors of graphs
From MaRDI portal
Publication:1085185
DOI10.1016/0095-8956(88)90068-8zbMath0607.05053OpenAlexW2054076729MaRDI QIDQ1085185
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(88)90068-8
Related Items
Win-win kernelization for degree sequence completion problems, An Extension of Cui-Kano's Characterization on Graph Factors, Approximation and Exact Algorithms for Special Cases of Connected f-Factors, A characterization of graphs having all \((g,f)\)-factors, The membership problem in jump systems, On degree sequence optimization, Optimization over degree sequences of graphs, Structure theorem and algorithm on \((1,f)\)-odd subgraph, Characterization of 1-tough graphs using factors, Antifactors of regular bipartite graphs, NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting, Optimal general factor problem and jump system intersection, Degree sequence optimization in bounded treewidth, Editing graphs to satisfy degree constraints: a parameterized approach, Tractable cases of the extended global cardinality constraint, Packing $k$-Matchings and $k$-Critical Graphs, Matchings with lower quotas: algorithms and complexity, On caterpillar factors in graphs, On the Complexity of Holant Problems, On specific factors in graphs, A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem, Graph editing to a given degree sequence, Structural properties of matroid matchings, Popular and clan-popular \(b\)-matchings, Graph editing problems with extended regularity constraints, Star Partitions of Perfect Graphs, Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming, Elementary graphs with respect to \(f\)-parity factors, Graph Editing to a Given Degree Sequence, An algorithmic study of switch graphs, The Simple Reachability Problem in Switch Graphs, Monadic Second Order Logic on Graphs with Local Cardinality Constraints, A note on \({\mathtt V}\)-free 2-matchings, Good characterizations for some degree constrained subgraphs, Polynomial cases of graph decomposition: A complete solution of Holyer's problem, The Nonnegative Node Weight j-Restricted k-Matching Problems, \(\{0, 2 \}\)-degree free spanning forests in graphs, Graph Orientation with Edge Modifications, On Cui-Kano's Characterization Problem on Graph Factors, 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs, A Tutte-Type Characterization for Graph Factors
Cites Work
