General antifactors of graphs
From MaRDI portal
Publication:1325259
DOI10.1006/jctb.1993.1035zbMath0794.05108OpenAlexW2154451802MaRDI QIDQ1325259
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
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items (9)
Antifactors of regular bipartite graphs ⋮ Optimal general factor problem and jump system intersection ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ Matchings with lower quotas: algorithms and complexity ⋮ A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem ⋮ Degree constrained subgraphs ⋮ Good characterizations for some degree constrained subgraphs ⋮ 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs ⋮ A Tutte-Type Characterization for Graph Factors
This page was built for publication: General antifactors of graphs
