Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486)
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 sum distinguishing total choosability of IC-planar graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total choosability of IC-planar graphs |
scientific article |
Statements
Neighbor sum distinguishing total choosability of IC-planar graphs (English)
0 references
8 January 2020
0 references
neighbor sum distinguishing total choosability
0 references
maximum degree
0 references
IC-planar graph
0 references
combinatorial nullstellensatz
0 references
0 references
0 references
0 references
