The \(k\)-distance chromatic number of trees and cycles
From MaRDI portal
Publication:2293844
DOI10.1016/j.akcej.2017.11.007zbMath1432.05043OpenAlexW2778750763MaRDI QIDQ2293844
Srinivasa Rao Kola, Niranjan P. K.
Publication date: 5 February 2020
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2017.11.007
Trees (05C05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (5)
Average distance colouring of graphs ⋮ Unnamed Item ⋮ On \(d_2\)-coloring of certain families of graphs ⋮ Further results on 2-distance coloring of graphs ⋮ On d-distance equitable chromatic number of some graphs
Cites Work
This page was built for publication: The \(k\)-distance chromatic number of trees and cycles