izpis_h1_title_alt

Remarks on the local irregularity conjecture
ID Sedlar, Jelena (Author), ID Škrekovski, Riste (Author)

.pdfPDF - Presentation file, Download (729,21 KB)
MD5: 7595A5813D63796FEF468EA06ABE17DA
URLURL - Source URL, Visit https://www.mdpi.com/2227-7390/9/24/3209 This link opens in a new window

Abstract
A locally irregular graph is a graph in which the end vertices of every edge have distinct degrees. A locally irregular edge coloring of a graph G is any edge coloring of G such that each of the colors induces a locally irregular subgraph of G. A graph G is colorable if it allows a locally irregular edge coloring. The locally irregular chromatic index of a colorable graph G, denoted by χ$^′_{irr}$(G), is the smallest number of colors used by a locally irregular edge coloring of G. The local irregularity conjecture claims that all graphs, except odd-length paths, odd-length cycles and a certain class of cacti are colorable by three colors. As the conjecture is valid for graphs with a large minimum degree and all non-colorable graphs are vertex disjoint cacti, we study rather sparse graphs. In this paper, we give a cactus graph B which contradicts this conjecture, i.e., χ$^′_{irr}$(B) = 4. Nevertheless, we show that the conjecture holds for unicyclic graphs and cacti with vertex disjoint cycles.

Language:English
Keywords:locally irregular edge coloring, local irregularity conjecture, unicyclic graph, cactus graph
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FMF - Faculty of Mathematics and Physics
Publication status:Published
Publication version:Version of Record
Year:2021
Number of pages:10 str.
Numbering:Vol. 9, iss. 24, art. 3209
PID:20.500.12556/RUL-136571 This link opens in a new window
UDC:519.17
ISSN on article:2227-7390
DOI:10.3390/math9243209 This link opens in a new window
COBISS.SI-ID:93453315 This link opens in a new window
Publication date in RUL:11.05.2022
Views:421
Downloads:54
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Record is a part of a journal

Title:Mathematics
Shortened title:Mathematics
Publisher:MDPI AG
ISSN:2227-7390
COBISS.SI-ID:523267865 This link opens in a new window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:12.12.2021

Secondary language

Language:Slovenian
Keywords:lokalno iregularno barvanje povezav, domneva o lokalni iregularnosti, uniciklični graf, kaktus graf

Projects

Funder:ARRS - Slovenian Research Agency
Project number:P1-0383
Name:Kompleksna omrežja

Funder:ARRS - Slovenian Research Agency
Project number:J1-1692
Name:Barvanja, dekompozicije in pokritja grafov

Funder:ARRS - Slovenian Research Agency
Project number:J1-3002
Name:Prirejanja in barvanja povezav v kubičnih grafih

Funder:Other - Other funder or multiple funders
Funding programme:Croatian Government
Project number:KK.01.1.1.02.0027

Funder:EC - European Commission
Funding programme:European Regional Development Fund, Competitiveness and Cohesion Operational Programme

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back