Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles |
scientific article |
Statements
Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (English)
0 references
8 January 2020
0 references
neighbor sum distinguishing total coloring
0 references
discharging method
0 references
planar graph
0 references
0 references
0 references
0 references
0 references
