Pages that link to "Item:Q1813711"

The following pages link to Simplified existence theorems for \((g,f)\)-factors (Q1813711):

Displaying 18 items.

• General fractional \(f\)-factor numbers of graphs (Q617025) (← links)
• Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm (Q686268) (← links)
• A simple existence criterion for \((g<f)\)-factors (Q757439) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Characterizations of maximum fractional \((g,f)\)-factors of graphs (Q947113) (← links)
• Constructive proof of deficiency theorem of \((g,f)\)-factor (Q989802) (← links)
• Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
• Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
• More sufficient conditions for a graph to have factors (Q1584225) (← links)
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs (Q1630936) (← links)
• Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties (Q1753364) (← links)
• An application of matching theory of edge-colourings (Q1923520) (← links)
• Rounding in symmetric matrices and undirected graphs (Q1923592) (← links)
• Fractional factors, component factors and isolated vertex conditions in graphs (Q2278109) (← links)
• Simplified existence theorems on all fractional \([a,b]\)-factors (Q2446850) (← links)
• Toughness and the existence of fractional \(k\)-factors of graphs (Q2477400) (← links)
• Analysis of fractional factor system for data transmission in SDN (Q2690823) (← links)
• Fractional factors and component factors in graphs with isolated toughness smaller than 1 (Q6657593) (← links)