Journal article

Hadwiger's conjecture for 3-arc graphs

David R Wood, Guangjun Xu, Sanming Zhou

The Electronic Journal of Combinatorics | ELECTRONIC JOURNAL OF COMBINATORICS | Published : 2016

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

University of Melbourne Researchers

Grants

Awarded by NSF of China


Awarded by Program for Sci-Tec Innovative Talents of Guizhou Province of China


Funding Acknowledgements

Supported in part by NSF of China (No.11661084) and Program for Sci-Tec Innovative Talents of Guizhou Province of China (No.[2015]502)