Back to search

East Tennessee State University

Neighborhood-Restricted Achromatic Colorings of Graphs

Abstract

dc:description.abstract

A (closed) neighborhood-restricted 2-achromatic-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. In other words, 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-achromatic-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.

Degree

thesis:*
Name thesis:degree_name
MS (Master of Science)
Level thesis:degree_level
Thesis - unrestricted
Discipline thesis:degree_discipline
Mathematical Sciences
Grantor dc:publisher
East Tennessee State University
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chandler, James D., Sr.

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • Copyright by the authors.
Language dc:language
eng

Identifiers

dc:identifier.*
Repository record dc:identifier
https://dc.etsu.edu/etd/3020

Chain of custody

source
Harvested from
East Tennessee State University
Base URL
dc.etsu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chandler, James D., Sr.. Neighborhood-Restricted Achromatic Colorings of Graphs. Thesis - unrestricted thesis, East Tennessee State University, 2016. https://dc.etsu.edu/etd/3020