On the complexity of determining the irregular chromatic index of a graph (Q2253909)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6403396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of determining the irregular chromatic index of a graph |
scientific article; zbMATH DE number 6403396 |
Statements
On the complexity of determining the irregular chromatic index of a graph (English)
0 references
13 February 2015
0 references
edge colouring
0 references
irregular chromatic index
0 references
irregular graph
0 references
locally irregular graph
0 references
0.8420133590698242
0 references
0.8306063413619995
0 references
0.8229314684867859
0 references
0.8112295866012573
0 references
0.791889488697052
0 references
