A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Hadwiger's conjecture for 3-arc graphs *
2016
unpublished
Preserved Fulltext
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.
fatcat:e3n65e33ufdxrk5htya7miovlq