Graph Edge Coloring: A Survey

Yan Cao; Guantao Chen; Guangming Jing; Michael Stiebitz; Bjarne Toft

doi:10.1007/s00373-018-1986-5

Graph Edge Coloring: A Survey

Yan Cao, Guantao Chen, Guangming Jing^*, Michael Stiebitz, Bjarne Toft

^*Kontaktforfatter

Institut for Matematik og Datalogi

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review

Abstract

Graph edge coloring has a rich theory, many applications and beautiful conjectures, and it is studied not only by mathematicians, but also by computer scientists. In this survey, written for the non-expert, we shall describe some main results and techniques and state some of the many popular conjectures in the theory. Besides known results a new basic result about brooms is obtained.

Originalsprog	Engelsk
Tidsskrift	Graphs and Combinatorics
Vol/bind	35
Udgave nummer	1
Sider (fra-til)	33-66
ISSN	0911-0119
DOI	https://doi.org/10.1007/s00373-018-1986-5
Status	Udgivet - jan. 2019

Dokumenter og links

10.1007/s00373-018-1986-5

Citationsformater

@article{07b94ca02b044580a6673d0c4773d7c9,

title = "Graph Edge Coloring: A Survey",

abstract = "Graph edge coloring has a rich theory, many applications and beautiful conjectures, and it is studied not only by mathematicians, but also by computer scientists. In this survey, written for the non-expert, we shall describe some main results and techniques and state some of the many popular conjectures in the theory. Besides known results a new basic result about brooms is obtained.",

keywords = "Adjacency lemma, Chromatic index, Edge coloring",

author = "Yan Cao and Guantao Chen and Guangming Jing and Michael Stiebitz and Bjarne Toft",

year = "2019",

month = jan,

doi = "10.1007/s00373-018-1986-5",

language = "English",

volume = "35",

pages = "33--66",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - Graph Edge Coloring

T2 - A Survey

AU - Cao, Yan

AU - Chen, Guantao

AU - Jing, Guangming

AU - Stiebitz, Michael

AU - Toft, Bjarne

PY - 2019/1

Y1 - 2019/1

N2 - Graph edge coloring has a rich theory, many applications and beautiful conjectures, and it is studied not only by mathematicians, but also by computer scientists. In this survey, written for the non-expert, we shall describe some main results and techniques and state some of the many popular conjectures in the theory. Besides known results a new basic result about brooms is obtained.

AB - Graph edge coloring has a rich theory, many applications and beautiful conjectures, and it is studied not only by mathematicians, but also by computer scientists. In this survey, written for the non-expert, we shall describe some main results and techniques and state some of the many popular conjectures in the theory. Besides known results a new basic result about brooms is obtained.

KW - Adjacency lemma

KW - Chromatic index

KW - Edge coloring

U2 - 10.1007/s00373-018-1986-5

DO - 10.1007/s00373-018-1986-5

M3 - Journal article

AN - SCOPUS:85059644259

SN - 0911-0119

VL - 35

SP - 33

EP - 66

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

Graph Edge Coloring: A Survey

Abstract

Dokumenter og links

Fingeraftryk

Citationsformater