scientific article; zbMATH DE number 1112370
From MaRDI portal
Publication:4374002
Recommendations
- A new lower bound on the independence number of graphs
- An improved lower bound on the independence number of a graph
- A lower bound on the independence number of a graph
- Bounds on the independence number of a graph in terms of order, size and maximum degree
- A lower bound on the independence number of a graph in terms of degrees
Cited in
(19)- A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
- A lower bound on the independence number of a graph
- The lower bound on independence number.
- An upper bound on the independence number of a graph computable in polynomial-time
- A new lower bound on the independence number of graphs
- On Selkow's bound on the independence number of graphs
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes
- New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph
- scientific article; zbMATH DE number 3989382 (Why is no real title available?)
- Improved lower bounds on k‐independence
- New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth
- Lower bounds on size and independence inK4-free graphs
- An improved lower bound on the independence number of a graph
- scientific article; zbMATH DE number 866059 (Why is no real title available?)
- Bounds on the independence number of a graph in terms of order, size and maximum degree
- A new notion of vertex independence and rank for finite graphs
- New results on \(k\)-independence of graphs
- A lower bound on the independence number of a graph in terms of degrees
- Lower bounds on the independence number of certain graphs of odd girth at least seven
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 Q4374002)
