Subgraphs of minimal degree k
From MaRDI portal
Recommendations
- Smaller subgraphs of minimum degree \(k\)
- scientific article; zbMATH DE number 747033
- Minus \(k\)-subdomination in graphs
- Minus total \(k\)-subdomination in graphs
- Minimum clique-free subgraphs of Kneser graphs
- The minimum number of subgraphs in a graph and its complement
- Minus edge \(k\)-subdomination numbers in graphs
- Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
- Subdivisions of graphs with large minimum degree
- Minus \(k\)-subdomination in graphs. II
Cites work
Cited in
(30)- On the approximability of some degree-constrained subgraph problems
- Full subgraphs
- Smaller subgraphs of minimum degree \(k\)
- scientific article; zbMATH DE number 867705 (Why is no real title available?)
- scientific article; zbMATH DE number 1191208 (Why is no real title available?)
- scientific article; zbMATH DE number 3959468 (Why is no real title available?)
- Construction of a family of graphs with a small induced proper subgraph with minimum degree 3
- The maximum binary tree problem
- scientific article; zbMATH DE number 3948308 (Why is no real title available?)
- scientific article; zbMATH DE number 4065027 (Why is no real title available?)
- scientific article; zbMATH DE number 4065028 (Why is no real title available?)
- The Maximum Binary Tree Problem.
- Graphs without proper subgraphs of minimum degree 3 and short cycles
- On Approximating the d-Girth of a Graph
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- Subgraphs of graphs. I
- Forbidden graphs for degree and neighbourhood conditions
- On approximating the \(d\)-girth of a graph
- Some consideration about component minimal complete subgraph
- Minimum degree and density of binary sequences
- Minimum clique-free subgraphs of Kneser graphs
- Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
- Subforests of bipartite digraphs---the minimum degree condition
- A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\)
- Minimum k‐cores and the k‐core polytope
- Parameterized complexity of finding small degree-constrained subgraphs
- Subdivisions of graphs with large minimum degree
- A note on internal partitions: the 5-regular case and beyond
- Graphs with unavoidable subgraphs with large degrees
- On dynamic monopolies of graphs with general thresholds
This page was built for publication: Subgraphs of minimal degree \(k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750456)
