Neighbor sum distinguishing total chromatic number of planar graphs without 4-cycles (Q4604358)
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 chromatic number of planar graphs without 4-cycles |
scientific article; zbMATH DE number 6843430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total chromatic number of planar graphs without 4-cycles |
scientific article; zbMATH DE number 6843430 |
Statements
23 February 2018
0 references
neighbor sum distinguishing total coloring
0 references
neighbor sum distinguishing total chromatic number
0 references
planar graph
0 references
0.9651813507080078
0 references
0.9530630707740784
0 references
0.945471167564392
0 references
0.9426405429840088
0 references
0.9202155470848083
0 references
