Chandran, Sunil L and Rajendraprasad, Deepak and Tesar, Marek
(2017)
*Rainbow colouring of split graphs.*
In: DISCRETE APPLIED MATHEMATICS, 216
(1, SI).
pp. 98-113.

PDF
Dis_App_Mat_216_98_2017.pdf - Published Version Restricted to Registered users only Download (620kB) | Request a copy |

## Abstract

A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one rainbow path. The minimum number of colours required to rainbow colour G is called its rainbow connection number. It is known that, unless P = NP, the rainbow connection number of a graph cannot be approximated in polynomial time to a multiplicative factor less than 5/4, even when the input graph is chordal Chandran and Rajendraprasad, FSTTCS 2013]. In this article, we determine the computational complexity of the above problem on successively more restricted graph classes, viz.: split graphs and threshold graphs. In particular, we establish the following: 1. The problem of deciding whether a given split graph can be rainbow coloured using k colours is NP-complete for k is an element of {2, 3}, but can be solved in polynomial time for all other values of k. Furthermore, any split graph can be rainbow coloured in linear time using at most one more colour than the optimum. 2. For every positive integer k, threshold graphs with rainbow connection number k can be characterised based on their degree sequence alone. Furthermore, we can optimally rainbow colour a threshold graph in linear time. (C) 2015 Elsevier B.V. All rights reserved.

Item Type: | Journal Article |
---|---|

Additional Information: | Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS |

Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |

Depositing User: | Id for Latest eprints |

Date Deposited: | 31 Jan 2017 05:27 |

Last Modified: | 31 Jan 2017 05:27 |

URI: | http://eprints.iisc.ac.in/id/eprint/56033 |

### Actions (login required)

View Item |