Hadwiger's conjecture for 3-arc graphs
arXiv:1310.4337
Abstract
The 3-arc graph of a digraph is defined to have vertices the arcs of such that two arcs are adjacent if and only if and are distinct arcs of with , and adjacent. We prove that Hadwiger's conjecture holds for 3-arc graphs.