scientific article; zbMATH DE number 3365308
From MaRDI portal
Publication:5638352
Recommendations
Cited in
(25)- Extremality of degree-based graph entropies
- Large dense neighbourhoods and Turán's theorem
- The multiplicative sum Zagreb indices of graphs with given clique number
- Lower bounds on the stability number of graphs computed in terms of degrees
- An analytic approach to stability
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- Ultimate greedy approximation of independent sets in subcubic graphs
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
- Turán’s Theorem Through Algorithmic Lens
- Independent sets in graphs
- General multiplicative Zagreb indices of graphs with given clique number
- Vertex-degree function index for concave functions of graphs with a given clique number
- A note on greedy algorithms for the maximum weighted independent set problem
- The zeroth-order general Randic index of graphs with a given clique number
- Simple and local independent set approximation
- The Zagreb indices of graphs with a given clique number
- Refinement on Spectral Turán’s Theorem
- Efficient bounds for the stable set, vertex cover and set packing problems
- On the Turán number for the hexagon
- A hypergraph extension of Turán's theorem
- Turán's theorem and maximal degrees
- A note on Turán's theorem
- Some extremal graphs with respect to inverse degree
- The independence number of graphs in terms of degrees
- scientific article; zbMATH DE number 4181368 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5638352)
