On vertex-distinguishing-equitable edge chromatic numbers of \(M(S_n)\) and \(M(F_n)\) graphs (Q2859607)
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 6230060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On vertex-distinguishing-equitable edge chromatic numbers of \(M(S_n)\) and \(M(F_n)\) graphs |
scientific article; zbMATH DE number 6230060 |
Statements
19 November 2013
0 references
Mycielski graph
0 references
vertex-distinguishing-equitable edge coloring
0 references
vertex-distinguishing-equitable edge chromatic number
0 references
On vertex-distinguishing-equitable edge chromatic numbers of \(M(S_n)\) and \(M(F_n)\) graphs (English)
0 references
0.8880279660224915
0 references
0.8828018307685852
0 references
0.8688832521438599
0 references
