Hadwiger's Conjecture seems difficult to attack, even in the very special case of graphs G of independence number α (G) = 2. We present some results in this special case
The Hadwiger number h(G) of a graph G is the maximum integer t such that K-t is a minor of G. Since ...
Graph theory is the study of graphs that represent a specific relation between pairs of objects from...
AbstractWe investigate Hadwiger's conjecture for graphs with no stable set of size 3. Such a graph o...
Hadwiger's Conjecture seems difficult to attack, even in the very special case of graphs G of indepe...
Let $h(G)$ denote the largest $t$ such that $G$ contains $K_t$ as a minor, $\chi(G)$ the chromatic n...
AbstractAssuming that a graph G on n vertices is a minimal counterexample to Hadwiger's Conjecture χ...
Given a graph G, the Hadwiger number of G, denoted by h(G), is the largest integer κ such that G con...
AbstractSince χ(G)·α(G)⩾n(G), Hadwiger's conjecture implies that any graph G has the complete graph ...
The Hadwiger number h(G) of a graph G is the maximum integer f such that Kt is a minor of G. Since ξ...
Hadwiger's Conjecture seems dicult to attack, even in the very special case of graphs G of inde...
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 size of a complete minor of G. Hadwiger's Conje...
AbstractA weakening of Hadwiger’s conjecture states that every n-vertex graph with independence numb...
AbstractThe Hadwiger number η(G) of a graph G is the largest integer h such that the complete graph ...
The Hadwiger number $\eta(G)$ of a graph G is the largest integer h such that the complete graph on ...
The Hadwiger number h(G) of a graph G is the maximum integer t such that K-t is a minor of G. Since ...
Graph theory is the study of graphs that represent a specific relation between pairs of objects from...
AbstractWe investigate Hadwiger's conjecture for graphs with no stable set of size 3. Such a graph o...
Hadwiger's Conjecture seems difficult to attack, even in the very special case of graphs G of indepe...
Let $h(G)$ denote the largest $t$ such that $G$ contains $K_t$ as a minor, $\chi(G)$ the chromatic n...
AbstractAssuming that a graph G on n vertices is a minimal counterexample to Hadwiger's Conjecture χ...
Given a graph G, the Hadwiger number of G, denoted by h(G), is the largest integer κ such that G con...
AbstractSince χ(G)·α(G)⩾n(G), Hadwiger's conjecture implies that any graph G has the complete graph ...
The Hadwiger number h(G) of a graph G is the maximum integer f such that Kt is a minor of G. Since ξ...
Hadwiger's Conjecture seems dicult to attack, even in the very special case of graphs G of inde...
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 size of a complete minor of G. Hadwiger's Conje...
AbstractA weakening of Hadwiger’s conjecture states that every n-vertex graph with independence numb...
AbstractThe Hadwiger number η(G) of a graph G is the largest integer h such that the complete graph ...
The Hadwiger number $\eta(G)$ of a graph G is the largest integer h such that the complete graph on ...
The Hadwiger number h(G) of a graph G is the maximum integer t such that K-t is a minor of G. Since ...
Graph theory is the study of graphs that represent a specific relation between pairs of objects from...
AbstractWe investigate Hadwiger's conjecture for graphs with no stable set of size 3. Such a graph o...
DOI
Add to ORKG