Constructive proof of deficiency theorem of (g,f)-factor
From MaRDI portal
Publication:989802
DOI10.1007/S11425-010-3079-7zbMATH Open1209.05186OpenAlexW2032266235MaRDI QIDQ989802FDOQ989802
Hongliang Lu, Qinglin Roger Yu
Publication date: 23 August 2010
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-010-3079-7
Recommendations
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- Linear-time certifying algorithms for near-graphical sequences
- Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm
- An alternative proof of general factor structure theorem
- A simple existence criterion for \((g<f)\)-factors
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (8)
- A simple existence criterion for \((g<f)\)-factors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm
- General fractional \(f\)-factor numbers of graphs
- Simplified existence theorems for \((g,f)\)-factors
- An alternative proof of general factor structure theorem
This page was built for publication: Constructive proof of deficiency theorem of \((g,f)\)-factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989802)