On the Hadwiger's conjecture for graph products (Q864168): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.06.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021312663 / rank | |||
Normal rank | |||
Revision as of 22:44, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hadwiger's conjecture for graph products |
scientific article |
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
