Optimal channel assignment with list-edge coloring (Q2424801)
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 7073178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal channel assignment with list-edge coloring |
scientific article; zbMATH DE number 7073178 |
Statements
Optimal channel assignment with list-edge coloring (English)
0 references
25 June 2019
0 references
choosability
0 references
planar graph
0 references
intersecting
0 references
chordal
0 references
0 references
0 references
0.9098748
0 references
0.9082514
0 references
0.88193417
0 references
0.8793801
0 references
0.8670922
0 references
0.86596406
0 references
0.86571574
0 references
