"Neighborhood-Restricted [≤2]-Achromatic Colorings" by James D. Chandler, Wyatt J. Desormeaux et al.
 

Neighborhood-Restricted [≤2]-Achromatic Colorings

Document Type

Article

Publication Date

7-10-2016

Description

A (closed) neighborhood-restricted [≤2]-coloring of a graph G is an assignment of colors to the vertices of G such that no more than two colors are assigned in any closed neighborhood, that is, for every vertex v in G, the vertex v and its neighbors are in at most two different color classes. The [≤2]-achromatic number is defined as the maximum number of colors in any [≤2]-coloring of G. We study the [≤2]-achromatic number. In particular, we improve a known upper bound and characterize the extremal graphs for some other known bounds.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 1
  • Usage
    • Abstract Views: 3
  • Captures
    • Readers: 6
see details

Share

COinS