On the edge achromatic numbers of complete graphs (Q1117240)
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: On the edge achromatic numbers of complete graphs |
scientific article; zbMATH DE number 4091532
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the edge achromatic numbers of complete graphs |
scientific article; zbMATH DE number 4091532 |
Statements
On the edge achromatic numbers of complete graphs (English)
0 references
1989
0 references
The achromatic index of the complete graph with n vertices is the maximum number of colors used to color its edges such that no adjacent edges are of the same color, and, for any two colors \(c_ 1\) and \(c_ 2\), there are two adjacent edges, one colored by \(c_ 1\) and the other colored by \(c_ 2\). Bounds, as well as precise values for small n, of the achromatic index are studied.
0 references
edge coloring
0 references
achromatic index
0 references
complete graph
0 references
