List star edge coloring of generalized Halin graphs
Zhengke Miao, Yimin Song, Tao Wang, Xiaowei Yu

TL;DR
This paper investigates the list star edge coloring of generalized Halin graphs, establishing upper bounds on the list star chromatic index that depend on the graph's maximum degree and structure, with bounds proven to be sharp.
Contribution
It extends star edge coloring results to generalized Halin graphs, providing new upper bounds for their list star chromatic index based on structural parameters.
Findings
Upper bound for list star chromatic index when |C| ≠ 5
For Δ ≥ 13, the bound is at most ⌊3Δ/2⌋
The bounds are proven to be sharp
Abstract
A star -edge coloring is a proper edge coloring such that there are no bichromatic paths or cycles of length four. The smallest integer such that admits a star -edge coloring is the star chromatic index of . Deng \etal \cite{MR2933839}, and Bezegov{\'a} \etal \cite{MR3431294} independently proved that the star chromatic index of a tree is at most , and the bound is sharp. Han \etal \cite{MR3924408} strengthened the result to list version of star chromatic index, and proved that is also the sharp upper bound for the list star chromatic index of trees. A generalized Halin graph is a plane graph that consists of a plane embedding of a tree with , and a cycle connecting all the leaves of the tree such that is the boundary of the exterior face. In this paper, we prove that if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research
