Name
Abstract | ||
|---|---|---|
The star chromatic index χst′(G) of a graph G is the smallest integer k for which G has a proper edge k-coloring without bichromatic paths or cycles of length four. The strong chromatic index χs′(G) of G is the smallest integer k for which G has a proper edge k-coloring such that any two edges at distance at most two get distinct colors. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.amc.2018.03.079 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Star chromatic index,Strong chromatic index,Planar graph,Outerplanar graph,Edge-partition | Integer,Graph,Edge coloring,Outerplanar graph,Combinatorics,Mathematical analysis,Degree (graph theory),Partition (number theory),Planar graph,Mathematics | Journal |
Volume | ISSN | Citations |
333 | 0096-3003 | 2 |
PageRank | References | Authors |
0.40 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiqiao Wang | 1 | 494 | 42.81 |
| Weifan Wang | 2 | 868 | 89.92 |
| Ying Wang | 3 | 147 | 63.35 |