Bounding the monomial index and \((1,l)\)-weight choosability of a graph (Q2928589)
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: Bounding the monomial index and \((1,l)\)-weight choosability of a graph |
scientific article; zbMATH DE number 6367137
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding the monomial index and \((1,l)\)-weight choosability of a graph |
scientific article; zbMATH DE number 6367137 |
Statements
10 November 2014
0 references
1-2-3 conjecture
0 references
combinatorial nullstellensatz
0 references
permanents
0 references
graph colouring
0 references
graph labelling
0 references
math.CO
0 references
Bounding the monomial index and \((1,l)\)-weight choosability of a graph (English)
0 references
