arbiter
JournalsPricingAccount

Locally irregular edge-coloring of claw-free graphs with maximum degree 4

Wei Li et al.

Discrete Applied Mathematics2026https://doi.org/10.1016/j.dam.2026.03.042article
AJG 2
Weight
0.50

What the paper says

A graph is locally irregular if no two adjacent vertices have the same degree. A locally irregular edge-coloring of a graph G is such an (improper) edge-coloring that the edges of any fixed color induce a locally irregular subgraph. A decomposable graph G is any graph which admits a locally irregular edge-coloring. The locally irregular chromatic index χ i r r ′ ( G ) of a decomposable graph G is the smallest number of colors required by a locally irregular edge-coloring of G . In this paper, we establish that χ i r r ′ ( G ) ≤ 5 for all claw-free graphs with maximum degree 4.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1016/j.dam.2026.03.042

Or copy a formatted citation

@article{wei2026,
  title        = {{Locally irregular edge-coloring of claw-free graphs with maximum degree 4}},
  author       = {Wei Li et al.},
  journal      = {Discrete Applied Mathematics},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1016/j.dam.2026.03.042},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Locally irregular edge-coloring of claw-free graphs with maximum degree 4

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.