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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 976; s. 114160
Hlavní autori:	Abidha, V.P., Ashok, Pradeesha, Tomar, Avi, Yadav, Dolly
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 17.10.2023
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!