Good characterizations for some degree constrained subgraphs

DOI10.1016/j.jctb.2008.08.009zbMath1228.05276OpenAlexW2063451410MaRDI QIDQ1003846

Jácint Szabó

Publication date: 4 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.08.009

zbMATH Keywords

Gallai-Edmonds decompositiondegree constrained subgraph problemgadgets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (4)

Maximum and optimal 1-2 matching problem of the different kind ⋮ Noncontextual coloring of orthogonality hypergraphs ⋮ Antifactors of regular bipartite graphs ⋮ A Tutte-Type Characterization for Graph Factors

Cites Work

• An extension of matching theory
• General factors of graphs
• On matroids induced by packing subgraphs
• Packing subgraphs in a graph
• General antifactors of graphs
• Antifactors of graphs
• Gadget classification
• Paths, Trees, and Flowers
• The factorization of graphs. II
• Integer Programming and Combinatorial Optimization
• A Short Proof of the Factor Theorem for Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Good characterizations for some degree constrained subgraphs