Loading...
Please wait, while we are loading the content...
Similar Documents
Two Upper Bounds for the Strong Edge Chromatic Number (0)
| Content Provider | CiteSeerX |
|---|---|
| Author | Ghandehari, Mahya Hatami, Hamed |
| Abstract | A proper edge coloring c of a graph G is called a k-strong edge coloring, if for every two distinct vertices u and v of G with distances less than or equal to k, the set of the colors appear in the adjacent edges of these two vertices are not equal. The k-strong chromatic number s (G; k) is the minimum number of colors required for a k-strong edge coloring of G. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Strong Edge Chromatic Number K-strong Edge Coloring Distinct Vertex K-strong Chromatic Number Adjacent Edge Proper Edge |
| Content Type | Text |
