Star Chromatic Index of Halin Graphs

MaRDI QIDQ6361912zbMATH OpenFDO

Publication date 2 March 2021

Abstract: A star edge coloring of a graph

G

is a proper edge coloring of

G

such that every path and cycle of length four in

G

uses at least three different colors. The star chromatic index of

G

, is the smallest integer

k

for which

G

admits a star edge coloring with

k

colors. In this paper, we obtain tight upper bound

l e f t l f l o o r f r a c 3 D e l t a 2 i g h t f l o o r + 2

for the star chromatic index of every Halin graph, that proves the conjecture of Dvo{v{r}}{'a}k et al. (J Graph Theory, 72 (2013), 313--326) for cubic Halin graphs.

This page was built for publication: Star Chromatic Index of Halin Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6361912)