Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable |
scientific article; zbMATH DE number 6918720
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable |
scientific article; zbMATH DE number 6918720 |
Statements
Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (English)
0 references
15 August 2018
0 references
1-2-3 conjecture
0 references
total weighting
0 references
\((k, k^\prime)\)-choosable graphs
0 references
combinatorial Nullstellensatz
0 references
maximum average degree
0 references
