The strong chromatic index of Halin graphs

@article{Lai2012TheSC,
  title={The strong chromatic index of Halin graphs},
  author={Hsin-Hao Lai and Ko-Wei Lih and Ping-Ying Tsai},
  journal={Discrete Mathematics},
  year={2012},
  volume={312},
  pages={1536-1541}
}
The Strong Chromatic Index of Halin Graphs By Ziyu Hu A 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 they have adjacent endpoints. The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed for a strong edge coloring of G. A Halin… CONTINUE READING