Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Guang-Hui Wang / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6583926 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
neighbor sum distinguishing total coloring | |||
| Property / zbMATH Keywords: neighbor sum distinguishing total coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial nullstellensatz | |||
| Property / zbMATH Keywords: combinatorial nullstellensatz / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
neighbor sum distinguishing total choice number | |||
| Property / zbMATH Keywords: neighbor sum distinguishing total choice number / rank | |||
Normal rank | |||
Revision as of 19:04, 27 June 2023
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
