The strong chromatic index of Halin graphs
<p> A <i>strong edge coloring</i> of a graph <i>G</i> is an assignment of colors to the edges of G such that two distinct edges are colored differently if they have adjacent endpoints. The <i>strong chromatic index</i> of a graph <i>G,</i> denote...
| Main Author: | |
|---|---|
| Language: | EN |
| Published: |
California State University, Los Angeles
2015
|
| Subjects: | |
| Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=1583070 |