Colouring a dominating set without conflicts: q-Subset Square Colouring

The Square Colouring of a graph G refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colours. In this paper, we initiate the study of a related colouring problem called the subset square colouring of graphs. Broadly, the...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 976; p. 114160
Main Authors:	Abidha, V.P., Ashok, Pradeesha, Tomar, Avi, Yadav, Dolly
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 17.10.2023
Subjects:	Dominating set Graph colouring Parameterized algorithm Square Colouring Subset Square Colouring Graph colouring Subset Square Colouring Square Colouring Parameterized algorithm Dominating set
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!