Name
Abstract | ||
|---|---|---|
strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if their distance is at most two. The strong chromatic index of a graph G, denoted by [email protected]^'(G), is the minimum number of colors needed for a strong edge coloring of G. A Halin graph G is a plane graph constructed from a tree T without vertices of degree two by connecting all leaves through a cycle C. If a Halin graph [email protected]__ __C is different from a certain necklace Ne"2 and any wheel W"n, [email protected]__ __0(mod3), then we prove that [email protected]^'(G)= |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2011.09.016 | Discrete Mathematics |
Keywords | Field | DocType |
halin graph,strong chromatic index,strong edge coloring | Edge coloring,Wheel graph,Discrete mathematics,Combinatorics,Fractional coloring,Graph power,List coloring,Friendship graph,Halin graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
312 | 9 | 0012-365X |
Citations | PageRank | References |
5 | 0.49 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hsin-Hao Lai | 1 | 13 | 3.19 |
| Ko-wei Lih | 2 | 529 | 58.80 |
| Ping-Ying Tsai | 3 | 49 | 3.82 |