Pages that link to "Item:Q4033760"
From MaRDI portal
The following pages link to Algorithms for Degree Constrained Graph Factors of Minimum Deficiency (Q4033760):
Displayed 14 items.
- Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm (Q686268) (← links)
- Subgraphs with orthogonal factorizations and algorithms (Q709242) (← links)
- A simple existence criterion for \((g<f)\)-factors (Q757439) (← links)
- Greedily constructing maximal partial \(f\)-factors (Q1025473) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← 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)
- Rounding in symmetric matrices and undirected graphs (Q1923592) (← links)
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs (Q2581162) (← links)
- (Q4506268) (← links)
- (Q4540086) (← links)
- Minus domination in small-degree graphs (Q5928868) (← links)