Star edge-coloring of some special graphs
Abstract
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).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.