Projects per year
Abstract
The 3arc 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 3arc graphs.
Original language  English 

Article number  #P4.21 
Number of pages  18 
Journal  Electronic Journal of Combinatorics 
Volume  23 
Issue number  4 
Publication status  Published  10 Nov 2016 
Keywords
 3arc graph
 Graph colouring
 Graph minor
 Hadwiger’s conjecture
Projects
 1 Finished

Hadwiger's graph colouring conjecture
Wood, D. & Zhou, S.
Australian Research Council (ARC), University of Melbourne
1/01/12 → 30/04/15
Project: Research