2020/10/27 by Xuling Hou, Hou, Xuling, Lingxi Li +3 · 1 citation
Computer Science · Mathematics · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2010.14349
openalex publication_date 2020/10/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The star chromatic index of a multigraph G, denoted by χstar'(G), is the minimum number of colors needed to properly color the edges of G such that no path or cycle of length 4 is bicolored. In this paper, we study the star edge-coloring of Halin graphs, k-power graphs and the generalized Petersen graphs P(3n, n).