General antifactors of graphs

DOI10.1006/JCTB.1993.1035MaRDI QIDQ1325259zbMATH OpenOpenAlexFDO

Authors András Sebö

Publication date 30 June 1994

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1993.1035

zbMATH Keywords

polynomial algorithmgood characterizationantifactor problem

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• General factors of graphs
• An algorithmic proof of Tutte's f-factor theorem
• Antifactors of regular bipartite graphs
• Maximum \((g,f)\)-factors of a general graph

Cited in

(10)

• 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
• A Tutte-type characterization for graph factors
• A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
• Editing graphs to satisfy degree constraints: a parameterized approach
• Good characterizations for some degree constrained subgraphs
• Antifactors of regular bipartite graphs
• Degree constrained subgraphs
• Optimal general factor problem and jump system intersection
• AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
• Matchings with lower quotas: algorithms and complexity

This page was built for publication: General antifactors of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325259)