Complexity of Restricted Star Colouring

08/06/2021
by   Shalu M. A., et al.
0

Restricted star colouring is a variant of star colouring introduced to design heuristic algorithms to estimate sparse Hessian matrices. For k∈ℕ, a k-restricted star colouring (k-rs colouring) of a graph G is a function f:V(G)→0,1,…,k-1 such that (i)f(x)≠ f(y) for every edge xy of G, and (ii) there is no bicoloured 3-vertex path (P_3) in G with the higher colour on its middle vertex. We show that for k≥ 3, it is NP-complete to test whether a given planar bipartite graph of maximum degree k and arbitrarily large girth admits a k-rs colouring, and thereby answer a problem posed by Shalu and Sandhya (Graphs and Combinatorics, 2016). In addition, it is NP-complete to test whether a 3-star colourable graph admits a 3-rs colouring. We also prove that for all ϵ > 0, the optimization problem of restricted star colouring a 2-degenerate bipartite graph with the minimum number of colours is NP-hard to approximate within n^(1/3)-ϵ. On the positive side, we design (i) a linear-time algorithm to test 3-rs colourability of trees, and (ii) an O(n^3)-time algorithm to test 3-rs colourability of chordal graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2023

Hardness Transitions of Star Colouring and Restricted Star Colouring

We study how the complexity of the graph colouring problems star colouri...
research
07/20/2021

Steiner Tree in k-star Caterpillar Convex Bipartite Graphs – A Dichotomy

The class of k-star caterpillar convex bipartite graphs generalizes the ...
research
02/25/2023

Cosecure Domination: Hardness Results and Algorithm

For a simple graph G=(V,E) without any isolated vertex, a cosecure domin...
research
04/09/2018

Characterizing Star-PCGs

A graph G is called a pairwise compatibility graph (PCG, for short) if i...
research
04/16/2018

Hardness and structural results for half-squares of restricted tree convex bipartite graphs

Let B=(X,Y,E) be a bipartite graph. A half-square of B has one color cla...
research
01/13/2018

Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications

A Not-All-Equal (NAE) decomposition of a graph G is a decomposition of t...
research
01/24/2023

Restricted optimal pebbling is NP-hard

Consider a distribution of pebbles on a graph. A pebbling move removes t...

Please sign up or login with your details

Forgot password? Click here to reset