Hadwiger's conjecture for 3-arc graphs
Combinatorics
2017-07-18 v2
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.
Keywords
Cite
@article{arxiv.1310.4337,
title = {Hadwiger's conjecture for 3-arc graphs},
author = {David R. Wood and Guangjun Xu and Sanming Zhou},
journal= {arXiv preprint arXiv:1310.4337},
year = {2017}
}