On \delta^(k)-colouring of Powers of Paths and Cycles

In a proper vertex colouring of a graph, the vertices are coloured in such a way that no two adjacent vertices receive the same colour, whereas in an improper vertex colouring, adjacent vertices are permitted to receive same colours subjected to some conditions. An edge of an improperly coloured gra...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Merlin Ellumkalayil, Sudev Naduvath
Format: article
Langue:EN
Publié: Georgia Southern University 2021
Sujets:
Accès en ligne:https://doaj.org/article/6fb2331bcd664f60b2c7dcc6cf1decde
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!