English

Hadwiger's conjecture for 3-arc graphs

Combinatorics 2017-07-18 v2

Abstract

The 3-arc graph of a digraph DD is defined to have vertices the arcs of DD such that two arcs uv,xyuv, xy are adjacent if and only if uvuv and xyxy are distinct arcs of DD with vxv\ne x, yuy\ne u and u,xu,x 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}
}
R2 v1 2026-06-22T01:48:04.676Z