Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 |
scientific article |
Statements
Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (English)
0 references
21 January 2021
0 references
1-planar graph
0 references
list neighbor sum distinguishing total coloring
0 references
discharging method
0 references
0 references
0 references
0 references
0 references
0 references
