General neighbour-distinguishing index of a graph

Ervin Gyori; Mirko Horňák; Cory Palmer; Mariusz Woźniak

doi:10.1016/j.disc.2007.07.046

General neighbour-distinguishing index of a graph

Ervin Gyori, Mirko Horňák, Cory Palmer, Mariusz Woźniak

Mathematics

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

32 Scopus citations

Abstract

It is proved that edges of a graph G with no component K₂ can be coloured using at most 2 ⌈ log₂ χ (G) ⌉ + 1 colours so that any two adjacent vertices have distinct sets of colours of their incident edges.

Original language	English
Pages (from-to)	827-831
Number of pages	5
Journal	Discrete Mathematics
Volume	308
Issue number	5-6
DOIs	https://doi.org/10.1016/j.disc.2007.07.046
State	Published - Mar 28 2008

Keywords

Colour set
Edge colouring
General neighbour-distinguishing index

Access to Document

10.1016/j.disc.2007.07.046

Cite this

@article{ddd9649854314321901fed1e063381f9,

title = "General neighbour-distinguishing index of a graph",

abstract = "It is proved that edges of a graph G with no component K2 can be coloured using at most 2 ⌈ log2 χ (G) ⌉ + 1 colours so that any two adjacent vertices have distinct sets of colours of their incident edges.",

keywords = "Colour set, Edge colouring, General neighbour-distinguishing index",

author = "Ervin Gyori and Mirko Hor{\v n}{\'a}k and Cory Palmer and Mariusz Wo{\'z}niak",

year = "2008",

month = mar,

day = "28",

doi = "10.1016/j.disc.2007.07.046",

language = "English",

volume = "308",

pages = "827--831",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "5-6",

}

TY - JOUR

T1 - General neighbour-distinguishing index of a graph

AU - Gyori, Ervin

AU - Horňák, Mirko

AU - Palmer, Cory

AU - Woźniak, Mariusz

PY - 2008/3/28

Y1 - 2008/3/28

N2 - It is proved that edges of a graph G with no component K2 can be coloured using at most 2 ⌈ log2 χ (G) ⌉ + 1 colours so that any two adjacent vertices have distinct sets of colours of their incident edges.

AB - It is proved that edges of a graph G with no component K2 can be coloured using at most 2 ⌈ log2 χ (G) ⌉ + 1 colours so that any two adjacent vertices have distinct sets of colours of their incident edges.

KW - Colour set

KW - Edge colouring

KW - General neighbour-distinguishing index

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

U2 - 10.1016/j.disc.2007.07.046

DO - 10.1016/j.disc.2007.07.046

M3 - Article

AN - SCOPUS:38049160572

SN - 0012-365X

VL - 308

SP - 827

EP - 831

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 5-6

ER -

General neighbour-distinguishing index of a graph

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this