Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hadwiger's conjecture for circular colorings of edge-weighted graphs |
scientific article |
Statements
Hadwiger's conjecture for circular colorings of edge-weighted graphs (English)
0 references
13 February 2007
0 references
A \(p\)-basic graph is a weighted complete graph, whose edge weights satisfy triangular inequalities, and whose optimal traveling salesman tour has length \(p\). It is proved that the weighted Hadwiger conjecture is (i) true for \(p> 4\) and for series-parallel graphs and (ii) false for \(p\geq 4\).
0 references
edge-weighted graph
0 references
circular coloring
0 references
edge-weighted minor
0 references
Hadwiger's conjecture
0 references
