An upper bound on the star chromatic index of graphs withΔ≥7
Kai Deng
Abstract
Kai Deng
Abstract
This paper defined the star-edge coloring and star chromatic index x′_s(G),and proved that if G is a graph withΔ≥7 then x′_s(G)≤[16(Δ-1)3/2].Our results implied that if G is a line graph with maximum degreeΔ≥12 then x_s(G)≤[16(Δ-1)3/2].
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.
This paper defined the star-edge coloring and star chromatic index x′_s(G),and proved that if G is a graph withΔ≥7 then x′_s(G)≤[16(Δ-1)3/2].Our results implied that if G is a line graph with maximum degreeΔ≥12 then x_s(G)≤[16(Δ-1)3/2].
Key concepts: Star (game theory), Edge coloring, Combinatorics, Mathematics, Chromatic scale, Graph, Index (typography), Windmill graph