Constructive proof of deficiency theorem of (g,f)-factor
From MaRDI portal
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
Cites work
Cited in
(10)- A simple existence criterion for \((g<f)\)-factors
- scientific article; zbMATH DE number 1876816 (Why is no real title available?)
- Linear-time certifying algorithms for near-graphical sequences
- scientific article; zbMATH DE number 721755 (Why is no real title available?)
- Minimum vertex weighted deficiency of (g,f)-factors: A greedy algorithm
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- General fractional \(f\)-factor numbers of graphs
- A Short Proof of Ore’s f-Factor Theorem Using Flows
- 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)
