A note on graph proper total colorings with many distinguishing constraints (Q264189)
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: A note on graph proper total colorings with many distinguishing constraints |
scientific article; zbMATH DE number 6563699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on graph proper total colorings with many distinguishing constraints |
scientific article; zbMATH DE number 6563699 |
Statements
A note on graph proper total colorings with many distinguishing constraints (English)
0 references
6 April 2016
0 references
vertex distinguishing coloring
0 references
edge-coloring
0 references
total coloring
0 references
0.8712435364723206
0 references
0.8665522933006287
0 references
0.8509011268615723
0 references
0.846795916557312
0 references
