Subgraphs of minimal degree \(k\)
From MaRDI portal
Publication:750456
DOI10.1016/0012-365X(90)90162-BzbMath0714.05033MaRDI QIDQ750456
Ralph J. Faudree, Paul Erdős, Cecil C. Rousseau, Richard H. Schelp
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
Related Items
The Maximum Binary Tree Problem., On dynamic monopolies of graphs with general thresholds, Parameterized complexity of finding small degree-constrained subgraphs, On the approximability of some degree-constrained subgraph problems, Minimum degree and density of binary sequences, A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\), Graphs without proper subgraphs of minimum degree 3 and short cycles, The maximum binary tree problem, Smaller subgraphs of minimum degree \(k\), On approximating the \(d\)-girth of a graph, On Approximating the d-Girth of a Graph, Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Cites Work