Pages that link to "Item:Q1122589"
From MaRDI portal
The following pages link to Long cycles in graphs with no subgraphs of minimal degree 3 (Q1122589):
Displaying 7 items.
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Minimum degree and density of binary sequences (Q709264) (← links)
- Graphs without proper subgraphs of minimum degree 3 and short cycles (Q1743173) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Minimum <i>k</i>‐cores and the <i>k</i>‐core polytope (Q6087566) (← links)
