The irregular chromatic index of trees
type: Dataset
contact point: Organization
  fn: CCSD
keyword: tree
keyword: infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm
keyword: reports
keyword: algorithm
keyword: irregular-chromatic-index
keyword: locally-irregular-edge-colouring
keyword: infoeu-reposemanticsreport
landing page: https://hal.science/hal-00805122
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.
issued: 2026-05-12T02:14:49.364331
language: en
modified: 2026-05-12T02:14:49.364336

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

test_moissonnage_selune
type: Agent