The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730)
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: The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles |
scientific article; zbMATH DE number 6687861
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles |
scientific article; zbMATH DE number 6687861 |
Statements
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (English)
0 references
22 February 2017
0 references
planar graph
0 references
adjacent vertex distinguishing total coloring
0 references
combinatorial Nullstellensatz
0 references
discharging method
0 references
0 references
0 references
0 references
0 references
0.9733059
0 references
0.9552757
0 references
0.95176256
0 references
0.94631857
0 references
0.94330263
0 references
0.93090975
0 references
0.93052053
0 references
0.9296791
0 references
