| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650779 | Discrete Mathematics | 2008 | 5 Pages |
Abstract
It is proved that edges of a graph G with no component K2K2 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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ervin Győri, Mirko Horňák, Cory Palmer, Mariusz Woźniak,