Hadwiger's conjecture for 3-arc graphs (Q727197)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6661373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hadwiger's conjecture for 3-arc graphs |
scientific article; zbMATH DE number 6661373 |
Statements
Hadwiger's conjecture for 3-arc graphs (English)
0 references
6 December 2016
0 references
Summary: The 3-arc graph of a digraph \(D\) is defined to have vertices the arcs of \(D\) such that two arcs \(uv\), \(xy\) are adjacent if and only if \(uv\) and \(xy\) are distinct arcs of \(D\) with \(v\neq x\), \(y\neq u\) and \(u\), \(x\) adjacent. We prove Hadwiger's conjecture for 3-arc graphs.
0 references
Hadwiger's conjecture
0 references
graph colouring
0 references
graph minor
0 references
3-arc graph
0 references
0.7993011474609375
0 references
0.795875608921051
0 references
0.7817801237106323
0 references
0.7728955149650574
0 references
0.7719108462333679
0 references
