Szczegóły publikacji
Opis bibliograficzny
Irregular edge coloring of 2-regular graphs / Sylwia CICHACZ, Jakub PRZYBYŁO // Discrete Mathematics and Theoretical Computer Science ; ISSN 1462-7264 . — 2011 — vol. 13 iss. 1, s. 1–11. — Bibliogr. s. 10–11
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 58266 |
|---|---|
| Data dodania do BaDAP | 2011-03-19 |
| Tekst źródłowy | URL |
| DOI | 10.46298/dmtcs.544 |
| Rok publikacji | 2011 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discrete Mathematics and Theoretical Computer Science |
Abstract
Let G be a simple graph and let us color its edges so that the multisets of colors around each vertex are distinct. The smallest number of colors for which such a coloring exists is called the irregular coloring number of G and is denoted by c(G). We determine the exact value of the irregular coloring number for almost all 2-regular graphs. The results obtained provide new examples demonstrating that a conjecture by Burris is false. As another consequence, we also determine the value of a graph invariant called the point distinguishing index (where sets, instead of multisets, are required to be distinct) for the same family of graphs.
