Hadwiger's conjecture for 3-arc graphs
classification
🧮 math.CO
keywords
arcsadjacentconjecturegraphshadwigerdefineddigraphdistinct
read the original 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\ne x$, $y\ne u$ and $u,x$ adjacent. We prove that Hadwiger's conjecture holds for 3-arc graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.