Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141)
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: Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve |
scientific article; zbMATH DE number 7161782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve |
scientific article; zbMATH DE number 7161782 |
Statements
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (English)
0 references
3 February 2020
0 references
planar graph
0 references
neighbor-distinguishing total coloring
0 references
discharging
0 references
combinatorial nullstellensatz
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
