A note on general neighbor-distinguishing total coloring of graphs. (Q2864467)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6236463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on general neighbor-distinguishing total coloring of graphs. |
scientific article; zbMATH DE number 6236463 |
Statements
6 December 2013
0 references
general neighbor-distinguishing total coloring
0 references
chromatic number of a graph
0 references
A note on general neighbor-distinguishing total coloring of graphs. (English)
0 references
0.8699686527252197
0 references
0.8661555051803589
0 references
0.8601895570755005
0 references
0.8560091257095337
0 references
