Pages that link to "Item:Q2214040"
From MaRDI portal
The following pages link to On the complexity of all \(( g , f )\)-factors problem (Q2214040):
Displaying 4 items.
- A characterization of graphs having all \((g,f)\)-factors (Q1366610) (← links)
- Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors (Q2147605) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Boshernitzan’s condition, factor complexity, and an application (Q5099091) (← links)