Abstract
A strong -edge-coloring of a graph is a mapping from to such that every pair of distinct edges at distance at most two receive different colors. The strong chromatic index of a graph is the minimum for which has a strong -edge-coloring. Denote . It is easy to see that for any graph , and the equality holds when is a tree. For a planar graph of maximum degree , it was proved that by using the Four Color Theorem. The upper bound was then reduced to , , , , under different conditions for and the girth. In this paper, we prove that if the girth of a planar graph is large enough and , then the strong chromatic index of is precisely . This result reflects the intuition that a planar graph with a large girth locally looks like a tree.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.