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.
@article{10_37236_5134,
author = {David R Wood and Guangjun Xu and Sanming Zhou},
title = {Hadwiger's conjecture for 3-arc graphs},
journal = {The electronic journal of combinatorics},
year = {2016},
volume = {23},
number = {4},
doi = {10.37236/5134},
zbl = {1351.05091},
url = {http://geodesic.mathdoc.fr/articles/10.37236/5134/}
}
TY - JOUR
AU - David R Wood
AU - Guangjun Xu
AU - Sanming Zhou
TI - Hadwiger's conjecture for 3-arc graphs
JO - The electronic journal of combinatorics
PY - 2016
VL - 23
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/5134/
DO - 10.37236/5134
ID - 10_37236_5134
ER -
%0 Journal Article
%A David R Wood
%A Guangjun Xu
%A Sanming Zhou
%T Hadwiger's conjecture for 3-arc graphs
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/5134/
%R 10.37236/5134
%F 10_37236_5134
David R Wood; Guangjun Xu; Sanming Zhou. Hadwiger's conjecture for 3-arc graphs. The electronic journal of combinatorics, Tome 23 (2016) no. 4. doi: 10.37236/5134
