The edge-distinguishing chromatic number of spider graphs with three legs or bounded leg lengths (Q5858878)
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 7333440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The edge-distinguishing chromatic number of spider graphs with three legs or bounded leg lengths |
scientific article; zbMATH DE number 7333440 |
Statements
14 April 2021
0 references
vertex coloring
0 references
edge-distinguishing
0 references
graph embedding
0 references
0.8667218089103699
0 references
0.7489809393882751
0 references
0.7482912540435791
0 references
