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)
Related Items (14)
A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\) ⋮ Smaller subgraphs of minimum degree \(k\) ⋮ Minimum k‐cores and the k‐core polytope ⋮ On dynamic monopolies of graphs with general thresholds ⋮ A note on internal partitions: the 5-regular case and beyond ⋮ Parameterized complexity of finding small degree-constrained subgraphs ⋮ On the approximability of some degree-constrained subgraph problems ⋮ On approximating the \(d\)-girth of a graph ⋮ The Maximum Binary Tree Problem. ⋮ Graphs without proper subgraphs of minimum degree 3 and short cycles ⋮ Minimum degree and density of binary sequences ⋮ Degree-Constrained Subgraph Problems: Hardness and Approximation Results ⋮ The maximum binary tree problem ⋮ On Approximating the d-Girth of a Graph
Cites Work
This page was built for publication: Subgraphs of minimal degree \(k\)
