Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: List edge and list total colourings of multigraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The list chromatic index of a bipartite multigraph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: List Total Colourings of Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: COLORING ALGORITHMS ON SUBCUBIC GRAPHS / rank | |||
Normal rank | |||
Revision as of 06:19, 2 July 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
