Hadwiger's Conjecture for 3-Arc Graphs

Electronic Journal Of Combinatorics

David R Wood¹ 

关键词: Hadwiger';    s conjecture;    Graph colouring;    Graph minor;    $3$-Arc graph;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 Hadwiger's conjecture for 3-ar

【 授权许可】

Others