Year: 2026
Type: article
Abstract: We study the k-distance chromatic number of unicyclic graphs, providing exact values for some families and bounds for others, with particular emphasis on the case k = 3.
Source: Discrete Mathematics Letters
Authors: Rosário Fernandes, Rúben Palma
Institution: Universidade Nova de Lisboa
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Awards: G4682719911, G8176001378
OpenAlex ID: W7223569855