Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786)
From MaRDI portal
!
WARNING
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 5644620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable |
scientific article; zbMATH DE number 5644620 |
Statements
Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (English)
0 references
9 December 2009
0 references
choosability
0 references
list coloring
0 references
total coloring
0 references
multigraph
0 references
0.8530228734016418
0 references
0.8527358770370483
0 references
0.8460420370101929
0 references
0.8430505990982056
0 references
