×
A coloring of a graph is a star coloring if (i) for every edge , and (ii) every path on four vertices uses at least three distinct colors. The star chromatic number of G, denoted by , is the smallest integer k such that G is star colorable using k colors.
Jan 26, 2023
Nov 22, 2022 · We show that STAR COLORING is fixed-parameter tractable when parameterized by (a) neighborhood diversity, (b) twin-cover, and (c) the combined parameters ...
Feb 9, 2023 · A star coloring of a graph G is a proper vertex coloring such that every path on four vertices uses at least three distinct colors.
In this paper, we initiate a study of STAR COLORING from the parameterized complexity perspective. We show that STAR COLORING is fixed-parameter tractable when ...
People also ask
Nov 22, 2022 · In this section, we show that Star Coloring is FPT when parameterized by neighborhood diversity. The key idea is to reduce star coloring on ...
Jan 21, 2024 · Besides determining the precise parameterized complexity of this problem, this implies that b-Coloring parameterized by pathwidth is W[t]-hard.
In this paper, we deal with the notion of star coloring of graphs. A star coloring of an undirected graph G is a proper vertex coloring of G.
In this paper, we study the parameterized complexity of the problem with respect to structural graph parameters.
공동 저자 ; On structural parameterizations of star coloring. S Bhyravarapu, IV Reddy. Conference on Algorithms and Discrete Applied Mathematics, 159-171, 2023.