The circular chromatic index of some class 2 graphs

Autor:	Adam Nadolski
Rok vydání:	2007
Předmět:	Discrete mathematics Complete coloring Upper and lower bounds Theoretical Computer Science Brooks' theorem Combinatorics Edge coloring Computer Science::Discrete Mathematics Discrete Mathematics and Combinatorics Cubic graph Graph coloring Invariant (mathematics) Graph property Mathematics
Zdroj:	Discrete Mathematics. 307:1447-1454
ISSN:	0012-365X
Popis:	In this paper we consider the circular edge coloring of four families of Class 2 graphs. For the first two we establish the exact value of the circular chromatic index. For the next two, namely Goldberg and Isaacs snarks we derive an upper bound on this graph invariant. Finally, we consider the computational complexity of some problems related to circular edge coloring.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f65c781694a2a305da25a469efc362b2 https://doi.org/10.1016/j.disc.2005.11.092 Zobrazit plný text záznamu Full Text from ScienceDirect