Pages that link to "Item:Q757439"
From MaRDI portal
The following pages link to A simple existence criterion for \((g<f)\)-factors (Q757439):
Displaying 20 items.
- Subgraphs with orthogonal factorizations and algorithms (Q709242) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Constructive proof of deficiency theorem of \((g,f)\)-factor (Q989802) (← links)
- Factors of trees (Q1331986) (← links)
- Toughness of graphs and \([2,b]\)-factors (Q1334935) (← links)
- \((a,b,k)\)-critical graphs (Q1375824) (← links)
- Some problems on factorizations with constraints in bipartite graphs (Q1811123) (← links)
- Simplified existence theorems for \((g,f)\)-factors (Q1813711) (← links)
- Randomly orthogonal \((g,f)\)-factorizations in graphs (Q1862827) (← links)
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (Q2012539) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Fractional factors, component factors and isolated vertex conditions in graphs (Q2278109) (← links)
- Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
- Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs (Q2461313) (← links)
- Degree constrained subgraphs (Q2482112) (← links)
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs (Q2581162) (← links)
- Ryser's theorem for \(\rho\)-Latin rectangles (Q2672929) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- Graph realizations: maximum degree in vertex neighborhoods (Q6098074) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)
