Hadwiger's Conjecture for 3-Arc Graphs
Keywords:
Hadwiger's conjecture, Graph colouring, Graph minor, $3$-Arc graph
Abstract
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.
Published
2016-11-10
How to Cite
Wood, D. R., Xu, G., & Zhou, S. (2016). Hadwiger’s Conjecture for 3-Arc Graphs. The Electronic Journal of Combinatorics, 23(4), P4.21. https://doi.org/10.37236/5134
Article Number
P4.21