Neighbor product distinguishing total coloring of planar graphs without 5-cycles (Q6661065)
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 product distinguishing total coloring of planar graphs without 5-cycles |
scientific article; zbMATH DE number 7965373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor product distinguishing total coloring of planar graphs without 5-cycles |
scientific article; zbMATH DE number 7965373 |
Statements
Neighbor product distinguishing total coloring of planar graphs without 5-cycles (English)
0 references
10 January 2025
0 references
neighbor product distinguishing total coloring
0 references
combinatorial nullstellensatz
0 references
discharging
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.935566782951355
0 references
0.9116548895835876
0 references
0.9104718565940856
0 references
0.8967725038528442
0 references
0.8888463973999023
0 references
