Hadwiger's Conjecture for 3-Arc Graphs
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\ne x$, $y\ne u$ and $u,x$ adjacent. We prove Hadwiger's conjecture for 3-arc graphs.
2015 ◽
Vol 114
◽
pp. 247-249
◽
Keyword(s):
2016 ◽
Vol 87
(2)
◽
pp. 337-341
◽
2017 ◽
Vol 31
(3)
◽
pp. 1572-1580
◽