Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6575693 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
neighbor sum distinguishing total coloring | |||
| Property / zbMATH Keywords: neighbor sum distinguishing total coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
choosability | |||
| Property / zbMATH Keywords: choosability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial nullstellensatz | |||
| Property / zbMATH Keywords: combinatorial nullstellensatz / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graph | |||
| Property / zbMATH Keywords: planar graph / rank | |||
Normal rank | |||
Revision as of 16:52, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total choosability of planar graphs without 4-cycles |
scientific article |
Statements
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (English)
0 references
2 May 2016
0 references
neighbor sum distinguishing total coloring
0 references
choosability
0 references
combinatorial nullstellensatz
0 references
planar graph
0 references
