Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (Q6657249)
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 planar graphs without intersecting 4-cycles |
scientific article; zbMATH DE number 7962109
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles |
scientific article; zbMATH DE number 7962109 |
Statements
Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (English)
0 references
6 January 2025
0 references
neighbor sum distinguishing total choosability
0 references
maximum degree
0 references
planar graph
0 references
0 references
0 references
0 references
0 references
0 references
0 references
