The irregular chromatic index of trees
type: Dataset
description: A graph G is locally irregular if adjacent vertices of G have distinct degrees. An edge colouring of G is locally irregular if each of its colours induces a locally irregular subgraph of G. The irregular chromatic index of G refers to the least number of colours used by a locally irregular edge colouring of G (if any). We propose a linear-time algorithm for determining the irregular chromatic index of any tree.
landing page: https://hal.science/hal-00805122
keyword: algorithm
keyword: infoeu-reposemanticsreport
keyword: infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm
keyword: irregular-chromatic-index
keyword: locally-irregular-edge-colouring
keyword: reports
keyword: tree
issued: 2026-05-12T02:14:49.364331
modified: 2026-05-12T02:14:49.364336
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

The irregular chromatic index of trees
type: Distribution
format: HTML
access URL: https://hal.science/hal-00805122
issued: 2026-05-12T02:14:49.429725
modified: 2026-05-12T02:14:49.349428