{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-4441"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-4441","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Neighborhood-Restricted Achromatic Colorings of Graphs","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Chandler, James D., Sr."],"institution":"East Tennessee State University","degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-05-01T07:00:00Z","date_published":"2016-05-01T07:00:00Z","updated_at":"2026-11-19T07:55:07Z","subjects":["Graph theory","neighborhood-restricted colorings; neighborhood-restricted-achromatic number","Other Mathematics"],"languages":["eng"],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/3020","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/3020","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/4441/viewcontent/ChandlerJ041916f.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-4441","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Chandler, James D., Sr."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2016-04-01T07:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2016-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["East Tennessee State University"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["East Tennessee State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph theory","neighborhood-restricted colorings; neighborhood-restricted-achromatic number","Other Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/4441/viewcontent/ChandlerJ041916f.pdf","https://dc.etsu.edu/etd/3020"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Neighborhood-Restricted Achromatic Colorings of Graphs"]}]}],"canonical_facts":{"dc:creator":["Chandler, James D., Sr."],"dc:date.available":["2016-04-01T07:00:00Z"],"dc:date.issued":["2016-05-01T07:00:00Z"],"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."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/4441/viewcontent/ChandlerJ041916f.pdf","https://dc.etsu.edu/etd/3020"],"dc:language":["eng"],"dc:publisher":["East Tennessee State University"],"dc:rights":["Copyright by the authors."],"dc:subject":["Graph theory","neighborhood-restricted colorings; neighborhood-restricted-achromatic number","Other Mathematics"],"dc:title":["Neighborhood-Restricted Achromatic Colorings of Graphs"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"],"thesis:institution_name":["East Tennessee State University"]},"updated_at":"2026-11-19T07:55:07Z"}