AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of the independence complex of a graph. They conjectured that this bound is optimal for every graph. We give two different arguments which show that the conjecture is false
We propose a new lower bound on the independence number of a graph. We show that our bound compares...
Let G be a graph with degree sequence (d v). If the maximum degree of any subgraph induced by a neig...
The independence number of a graph G, denoted (G), is the maximum cardi- nality of an independent ...
Abstract. Aharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
AbstractWe prove a new lower bound on the independence number of a simple connected graph in terms o...
AbstractWe study the class of independence complexes of claw-free graphs. The main theorem gives goo...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
International audienceWe propose a new lower bound on the independence number of a graph. We show th...
We propose a new lower bound on the independence number of a graph. We show that our bound compares ...
We propose a new lower bound on the independence number of a graph. We show that our bound compares...
Let G be a graph with degree sequence (d v). If the maximum degree of any subgraph induced by a neig...
The independence number of a graph G, denoted (G), is the maximum cardi- nality of an independent ...
Abstract. Aharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
AbstractWe prove a new lower bound on the independence number of a simple connected graph in terms o...
AbstractWe study the class of independence complexes of claw-free graphs. The main theorem gives goo...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
International audienceWe propose a new lower bound on the independence number of a graph. We show th...
We propose a new lower bound on the independence number of a graph. We show that our bound compares ...
We propose a new lower bound on the independence number of a graph. We show that our bound compares...
Let G be a graph with degree sequence (d v). If the maximum degree of any subgraph induced by a neig...
The independence number of a graph G, denoted (G), is the maximum cardi- nality of an independent ...
DOI
Add to ORKG