Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-008-0817-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-008-0817-5 / rank | |||
Normal rank | |||
Latest revision as of 14:38, 10 December 2024
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
