Hadwiger’s conjecture for 3-arc graphs

David Wood, Guangjun Xu, Sanming Zhou

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)


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 ≠ x, y ≠ u and u, x adjacent. We prove Hadwiger’s conjecture for 3-arc graphs.

Original languageEnglish
Article number#P4.21
Number of pages18
JournalElectronic Journal of Combinatorics
Issue number4
Publication statusPublished - 10 Nov 2016


  • 3-arc graph
  • Graph colouring
  • Graph minor
  • Hadwiger’s conjecture

Cite this