A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 6941030
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) |
scientific article; zbMATH DE number 6941030 |
Statements
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (English)
0 references
21 September 2018
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.9129447
0 references
0.90663815
0 references
0.90492153
0 references
0.90311074
0 references
0.9028063
0 references
0.90104103
0 references
0.9010221
0 references
0.8988972
0 references
0.89239305
0 references
