Star edge-coloring of some special graphs

10/27/2020
by   Xuling Hou, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2023

On Color Critical Graphs of Star Coloring

A star coloring of a graph G is a proper vertex-coloring such that no pa...
research
11/22/2022

On Structural Parameterizations of Star Coloring

A Star Coloring of a graph G is a proper vertex coloring such that every...
research
12/28/2019

Online Rainbow Coloring In Graphs

Rainbow coloring is a special case of edge coloring, where there must be...
research
05/04/2018

Coloring even-hole-free graphs with no star cutset

A hole is a chordless cycle of length at least 4. A graph is even-hole-f...
research
10/09/2019

Edge crossings in random linear arrangements

In spatial networks, vertices are arranged in some space and edges may c...
research
10/11/2022

Transforming RDF-star to Property Graphs: A Preliminary Analysis of Transformation Approaches – extended version

RDF and property graph models have many similarities, such as using basi...
research
05/25/2019

Properly colored C_4's in edge-colored graphs

When many colors appear in edge-colored graphs, it is only natural to ex...

Please sign up or login with your details

Forgot password? Click here to reset