On the Hadwiger's conjecture for graph products (Q864168)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Hadwiger's conjecture for graph products |
scientific article; zbMATH DE number 5124993
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hadwiger's conjecture for graph products |
scientific article; zbMATH DE number 5124993 |
Statements
On the Hadwiger's conjecture for graph products (English)
0 references
13 February 2007
0 references
The Hadwiger's conjecture for graphs is given in terms of their prime factorization. It is shown (among other things) that the Hadwiger conjecture is true for a graph \(G\) if the product dimension of \(G\) is at least \(2\log_2(\chi(G))+ 3\). The Hadwiger number of well-known graph products like \(d\)-dimensional hypercubes, Hamming graphs and the \(d\)-dimensional grids are consider, too.
0 references
Hadwiger's conjecture
0 references
Hadwiger number
0 references
graph minor
0 references
graph product
0 references
hypercube
0 references
0.94759125
0 references
0.9339713
0 references
0.9309182
0 references
0.9279337
0 references
0.92789966
0 references
0.9236874
0 references
0.9229322
0 references
0.9125976
0 references
0.91155165
0 references
