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 ≠ x, y ≠ u and u, x adjacent. We prove Hadwiger’s conjecture for 3-arc graphs.
|Number of pages||18|
|Journal||Electronic Journal of Combinatorics|
|Publication status||Published - 10 Nov 2016|
- 3-arc graph
- Graph colouring
- Graph minor
- Hadwiger’s conjecture