The following pages link to Subgraphs of minimal degree \(k\) (Q750456):
Displaying 28 items.
- On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
- 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)
- Forbidden graphs for degree and neighbourhood conditions (Q1119603) (← links)
- A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\) (Q1633743) (← links)
- Graphs without proper subgraphs of minimum degree 3 and short cycles (Q1743173) (← links)
- Subgraphs of graphs. I (Q1846887) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Minimum clique-free subgraphs of Kneser graphs (Q2243816) (← links)
- Construction of a family of graphs with a small induced proper subgraph with minimum degree 3 (Q2370438) (← links)
- Smaller subgraphs of minimum degree \(k\) (Q2409841) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Subdivisions of graphs with large minimum degree (Q3318810) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- (Q3728027) (← links)
- (Q3798686) (← links)
- Graphs with unavoidable subgraphs with large degrees (Q3808128) (← links)
- (Q3842518) (← links)
- Full subgraphs (Q4581273) (← links)
- Subgraphs of large minimal degree (Q4697454) (← links)
- (Q4873822) (← links)
- Large subgraphs of minimal density or degree (Q5284560) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Subforests of bipartite digraphs---the minimum degree condition (Q5959113) (← links)
- Minimum <i>k</i>‐cores and the <i>k</i>‐core polytope (Q6087566) (← links)
- A note on internal partitions: the 5-regular case and beyond (Q6121923) (← links)
