2008Journal of Lanzhou UniversityRequires access

An upper bound on the star chromatic index of graphs withΔ≥7

Kai Deng

Open publisher page 0 citations

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].

About this research paper

What this paper is about

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].

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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].

Key concepts: Star (game theory), Edge coloring, Combinatorics, Mathematics, Chromatic scale, Graph, Index (typography), Windmill graph

Related papers

Back to paper searchBrowse research topicsOriginal source
An upper bound on the star chromatic index of graphs withΔ≥7 — Research Paper | ScholarLens