Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
April 7, 2026Discrete Applied MathematicsOpen Access

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

View Full Paper
Ask AI
Bookmark
Share

Authors

WLWei LiXXXin XunJLJian-Bo Lv

Discussion

Loading...

Member takes

Overview

Establishes an upper limit on edge-coloring in claw-free graphs with a maximum degree of 4, indicating a significant finding in graph theory.

Key Points

  • The aim is to determine the chromatic index for locally irregular edge-coloring in claw-free graphs with a specified maximum degree.
  • Analysis of claw-free graphs with a maximum degree of 4
  • Definition and properties of locally irregular edge-coloring
  • Mathematical proofs to establish the upper limit of chromatic index
  • The locally irregular chromatic index χ i r r ′ ( G ) is shown to be less than or equal to 5 for specified graphs
  • Confirmed that claw-free graphs with a maximum degree of 4 admit this edge-coloring technique

Cite This Study

Li et al. (2026) studied this question.

synapsesocial.com/papers/69d49ecbb33cc4c35a227753https://doi.org/10.1016/j.dam.2026.03.042
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1On a new problem about the local irregularity of graphs2024 · 1 citations
  2. 2On the Inclusive Local Irregularity Vertex Coloring of Centripetal Graph Families2026
  3. 3Locally Irregular-Connected Graphs2026
  4. 4Computing the Edge Irregularity Strength of Some Classes of Grid Graphs2024
  5. 5Inclusive Local Irregularity Vertex Coloring In Grid Graph Family2024