Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127)
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: Hadwiger's conjecture for circular colorings of edge-weighted graphs |
scientific article; zbMATH DE number 5124958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hadwiger's conjecture for circular colorings of edge-weighted graphs |
scientific article; zbMATH DE number 5124958 |
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
0.95425093
0 references
0.94156307
0 references
0.9143536
0 references
0.90884113
0 references
0.9086369
0 references
0.9081198
0 references
