Hadwiger’s conjecture for 3-arc graphs

David Wood; Guangjun Xu; Sanming Zhou

Hadwiger’s conjecture for 3-arc graphs

David Wood, Guangjun Xu, Sanming Zhou

School of Mathematics

Research output: Contribution to journal › Article › Research › peer-review

1 Citation (Scopus)

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.

Original language	English
Article number	#P4.21
Number of pages	18
Journal	Electronic Journal of Combinatorics
Volume	23
Issue number	4
Publication status	Published - 10 Nov 2016

Keywords

3-arc graph
Graph colouring
Graph minor
Hadwiger’s conjecture

Access to Document

1 Finished

Hadwiger's graph colouring conjecture
Wood, D. & Zhou, S.
Australian Research Council (ARC), University of Melbourne
1/01/12 → 30/04/15
Project: Research

Cite this

@article{f8596315d5c04acbaa355a68e4c102e6,

title = "Hadwiger{\textquoteright}s conjecture for 3-arc graphs",

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{\textquoteright}s conjecture for 3-arc graphs.",

keywords = "3-arc graph, Graph colouring, Graph minor, Hadwiger{\textquoteright}s conjecture",

author = "David Wood and Guangjun Xu and Sanming Zhou",

year = "2016",

month = nov,

day = "10",

language = "English",

volume = "23",

journal = "The Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Clemson University Digital Press",

number = "4",

}

TY - JOUR

T1 - Hadwiger’s conjecture for 3-arc graphs

AU - Wood, David

AU - Xu, Guangjun

AU - Zhou, Sanming

PY - 2016/11/10

Y1 - 2016/11/10

N2 - 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.

AB - 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.

KW - 3-arc graph

KW - Graph colouring

KW - Graph minor

KW - Hadwiger’s conjecture

UR - http://www.scopus.com/inward/record.url?scp=84996618779&partnerID=8YFLogxK

UR - http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p21/pdf

M3 - Article

AN - SCOPUS:84996618779

VL - 23

JO - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

SN - 1077-8926

IS - 4

M1 - #P4.21

ER -

Hadwiger’s conjecture for 3-arc graphs

Abstract

Keywords

Access to Document

Projects

Hadwiger's graph colouring conjecture

Cite this