[HTML][HTML] On the precise value of the strong chromatic index of a planar graph with a large girth

GJ Chang, GH Duh - Discrete Applied Mathematics, 2018 - Elsevier
A strong k-edge-coloring of a graph G is a mapping from E (G) to {1, 2,…, k} such that every
pair of distinct edges at distance at most two receive different colors. The strong chromatic …

On the precise value of the strong chromatic-index of a planar graph with a large girth

GJ Chang, GH Duh - arXiv preprint arXiv:1508.03052, 2015 - arxiv.org
A strong $ k $-edge-coloring of a graph $ G $ is a mapping from $ E (G) $ to $\{1, 2,\ldots, k\}
$ such that every pair of distinct edges at distance at most two receive different colors. The …

[PDF][PDF] On the precise value of the strong chromatic index of a planar graph with a large girth

GJ Chang, GH Duh - 2015 - researchgate.net
A strong k-edge-coloring of a graph G is a mapping from E (G) to {1, 2,..., k} such that every
pair of distinct edges at distance at most two receive different colors. The strong chromatic …

On the precise value of the strong chromatic index of a planar graph with a large girth

GJ Chang, GH Duh - Discrete Applied Mathematics, 2018 - infona.pl
A strong k-edge-coloring of a graph G is a mapping from E (G) to {1, 2,…, k} such that every
pair of distinct edges at distance at most two receive different colors. The strong chromatic …

[PDF][PDF] On the precise value of the strong chromatic-index of a planar graph with a large girth

GJ Chang, GH Duh - arXiv preprint arXiv:1508.03052, 2015 - researchgate.net
A strong k-edge-coloring of a graph G is a mapping from E (G) to {1, 2,..., k} such that every
pair of distinct edges at distance at most two receive different colors. The strong chromatic …