Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 |
scientific article |
Statements
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (English)
0 references
25 June 2019
0 references
adjacent vertex distinguishing total coloring
0 references
planar graph
0 references
combinatorial Nullstellensatz
0 references
discharging
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
