Hadwiger's conjecture for 3-arc graphs (Q727197): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1310.4337 / rank | |||
Normal rank |
Revision as of 17:23, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hadwiger's conjecture for 3-arc graphs |
scientific article |
Statements
Hadwiger's conjecture for 3-arc graphs (English)
0 references
6 December 2016
0 references
Summary: 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\neq x\), \(y\neq u\) and \(u\), \(x\) adjacent. We prove Hadwiger's conjecture for 3-arc graphs.
0 references
Hadwiger's conjecture
0 references
graph colouring
0 references
graph minor
0 references
3-arc graph
0 references