Complexity and algorithms for injective edge-coloring in graphs (Q2032162)
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 7360081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and algorithms for injective edge-coloring in graphs |
scientific article; zbMATH DE number 7360081 |
Statements
Complexity and algorithms for injective edge-coloring in graphs (English)
0 references
16 June 2021
0 references
injective edge-coloring
0 references
planar graphs
0 references
subcubic graphs
0 references
graph algorithms
0 references
treewidth
0 references
0.8801210522651672
0 references
0.8394972681999207
0 references
0.8384624123573303
0 references
0.8361381888389587
0 references
0.8330928087234497
0 references
