Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10255-016-0583-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2344826748 / rank | |||
Normal rank | |||
Revision as of 02:00, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz |
scientific article |
Statements
Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (English)
0 references
23 May 2016
0 references
neighbor sum distinguishing total coloring
0 references
combinatorial nullstellensatz
0 references
neighbor sum distinguishing total choice number
0 references
