Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable |
scientific article |
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
