An algorithmic proof of Tutte's f-factor theorem

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

A simple existence criterion for \((g<f)\)-factors
Fractional (g,f)-factors of graphs
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
Algorithms for weighted matching generalizations. II: f-factors and the special case of shortest paths
On f-factors of a graph

Cited in

(51)

Linear-time certifying algorithms for near-graphical sequences
A polynomial algorithm for b-matchings: An alternative approach
Matching theory -- a sampler: From Dénes König to the present
General antifactors of graphs
Factors of trees
Finding a -regular supergraph of minimum order
More sufficient conditions for a graph to have factors
2-factors and Hamiltonicity
Some problems on factorizations with constraints in bipartite graphs
Simplified existence theorems for \((g,f)\)-factors
On f-factors of a graph
Randomly orthogonal (g,f)-factorizations in graphs
Rounding in symmetric matrices and undirected graphs
Improved approximation algorithms for the max edge-coloring problem
Forbidden subgraphs for existences of (connected) 2-factors of a graph
Relaxed and approximate graph realizations
Research on fractional critical covered graphs
A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
Nontrivial path covers of graphs: existence, minimization and maximization
Fractional matching preclusion number of graphs and the perfect matching polytope
Quasi-Eulerian hypergraphs
\((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
On the computational complexity of variants of combinatorial voter control in elections
Approximation and exact algorithms for special cases of connected f-factors
scientific article; zbMATH DE number 3855160 (Why is no real title available?)
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
Editing graphs to satisfy degree constraints: a parameterized approach
Orthogonal (g, f)-factorizations in networks
scientific article; zbMATH DE number 1769330 (Why is no real title available?)
Minimum degree conditions for the existence of fractional factors in planar graphs
Construction of k-matchings in graph products
Efficiently realizing interval sequences
Editing to Connected F-Degree Graph
Algorithmic complexity of weakly semiregular partitioning and the representation number
Some Results on Fractional Graph Theory
Fractional -factors in regular graphs
Algorithms for weighted matching generalizations. II: f-factors and the special case of shortest paths
Composed degree-distance realizations of graphs
Composed degree-distance realizations of graphs
Graph realizations: maximum degree in vertex neighborhoods
A Short Proof of Ore’s f-Factor Theorem Using Flows
Remarks on restricted fractional (g, f)-factors in graphs
On fractional (g, f, n^, m)-critical covered graphs
Minimum vertex weighted deficiency of (g,f)-factors: A greedy algorithm
Realizing graphs with cut constraints
Subgraphs with orthogonal factorizations and algorithms
Regular bipartite decompositions of pseudorandom graphs
Spanning Euler tours in hypergraphs
A simple existence criterion for \((g<f)\)-factors
Graph factors and factorization: 1985--2003: a survey
On fractional \((f,n)\)-critical graphs

This page was built for publication: An algorithmic proof of Tutte's f-factor theorem

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