Yang Qing-jun
Abstract
A strong edge-coloring of a graph is a proper edge-coloring,and no two edges with the same color lay on a path of length three.The strong chromatic index is the minimum number of colors that allow a strong edge-coloring.This paper considers some product graphs,and gives their precise strong chromatic index.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A strong edge-coloring of a graph is a proper edge-coloring,and no two edges with the same color lay on a path of length three.The strong chromatic index is the minimum number of colors that allow a strong edge-coloring.This paper considers some product graphs,and gives their precise strong chromatic index.
Key concepts: Edge coloring, Brooks' theorem, Fractional coloring, Graph coloring, Combinatorics, Complete coloring, Mathematics, List coloring