Loading...
- Type of Document: Article
- DOI: 10.1142/S1793830918500076
- Publisher: World Scientific Publishing Co. Pte Ltd , 2018
- Abstract:
- Let G be a graph. A vertex coloring ψ of G is called N2-vertex coloring if |ψ(v)|≤ 2 for every vertex v of G, where ψ(v) is the set of colors of vertices adjacent to v. Let t2(G) be the maximum number of colors used in an N2-vertex coloring of G. We provide some lower and upper bounds for t2(G) in terms of girth, diameter or size of G. Also, for every tree T, we obtain t2(T). © 2018 World Scientific Publishing Company
- Keywords:
- Graph coloring ; N2 - vertex coloring
- Source: Discrete Mathematics, Algorithms and Applications ; Volume 10, Issue 1 , 2018 ; 17938309 (ISSN)
- URL: https://www.worldscientific.com/doi/abs/10.1142/S1793830918500076