Szczegóły publikacji
Opis bibliograficzny
New bounds for locally irregular chromatic index of bipartite and subcubic graphs / Borut Lužar, Jakub PRZYBYŁO, Roman Soták // Journal of Combinatorial Optimization ; ISSN 1382-6905 . — 2018 — vol. 36 iss. 4, s. 1425–1438. — Bibliogr. s. 1438, Abstr. — Publikacja dostępna online od: 2018-06-08
Autorzy (3)
- Lužar Borut
- AGHPrzybyło Jakub
- Soták Roman
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 117891 |
|---|---|
| Data dodania do BaDAP | 2018-11-10 |
| Tekst źródłowy | URL |
| DOI | 10.1007/s10878-018-0313-7 |
| Rok publikacji | 2018 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Journal of Combinatorial Optimization |
Abstract
A graph is locally irregular if the neighbors of every vertex v have degrees distinct from the degree of v. A locally irregular edge-coloring of a graph G is an (improper) edge-coloring such that the graph induced on the edges of any color class is locally irregular. It is conjectured that three colors suffice for a locally irregular edge-coloring. In the paper, we develop a method using which we prove four colors are enough for a locally irregular edge-coloring of any subcubic graph admiting such a coloring. We believe that our method can be further extended to prove the tight bound of three colors for such graphs. Furthermore, using a combination of existing results, we present an improvement of the bounds for bipartite graphs and general graphs, setting the best upper bounds to 7 and 220, respectively.
