Add to ORKGHadwiger's Conjecture seems dicult to attack, even in the very special case of graphs G of independence number (G) = 2. We present some results in this special case
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractA weakening of Hadwiger’s conjecture states that every n-vertex graph with independence numb...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
Hadwiger's Conjecture seems difficult to attack, even in the very special case of graphs G of indepe...
The Hadwiger number h(G) of a graph G is the maximum integer f such that Kt is a minor of G. Since ξ...
AbstractThe Conjecture of Hadwiger implies that the Hadwiger number h times the independence number ...
The Hadwiger number h(G) of a graph G is the maximum integer t such that K-t is a minor of G. Since ...
Given a graph G, the Hadwiger number of G, denoted by h(G), is the largest integer κ such that G con...
AbstractIn [2] it is proved that the inequality η(G)·(2α(G) − 1⩾ n(G) holds for any graph G where η(...
The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conje...
AbstractSince χ(G)·α(G)⩾n(G), Hadwiger's conjecture implies that any graph G has the complete graph ...
In 1968, Vizing conjectured that, if G is a Delta-critical graph with n vertices, then alpha(G) \u3c...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
Abstract. An independent set Ic is a critical independent set if |Ic|−|N(Ic) | ≥ |J | − |N(J)|, for...
Let $h(G)$ denote the largest $t$ such that $G$ contains $K_t$ as a minor, $\chi(G)$ the chromatic n...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractA weakening of Hadwiger’s conjecture states that every n-vertex graph with independence numb...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
Hadwiger's Conjecture seems difficult to attack, even in the very special case of graphs G of indepe...
The Hadwiger number h(G) of a graph G is the maximum integer f such that Kt is a minor of G. Since ξ...
AbstractThe Conjecture of Hadwiger implies that the Hadwiger number h times the independence number ...
The Hadwiger number h(G) of a graph G is the maximum integer t such that K-t is a minor of G. Since ...
Given a graph G, the Hadwiger number of G, denoted by h(G), is the largest integer κ such that G con...
AbstractIn [2] it is proved that the inequality η(G)·(2α(G) − 1⩾ n(G) holds for any graph G where η(...
The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conje...
AbstractSince χ(G)·α(G)⩾n(G), Hadwiger's conjecture implies that any graph G has the complete graph ...
In 1968, Vizing conjectured that, if G is a Delta-critical graph with n vertices, then alpha(G) \u3c...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
Abstract. An independent set Ic is a critical independent set if |Ic|−|N(Ic) | ≥ |J | − |N(J)|, for...
Let $h(G)$ denote the largest $t$ such that $G$ contains $K_t$ as a minor, $\chi(G)$ the chromatic n...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractA weakening of Hadwiger’s conjecture states that every n-vertex graph with independence numb...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...