{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:13Z","timestamp":1740155953216,"version":"3.37.3"},"reference-count":3,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,2]]},"abstract":"<jats:p> Let [Formula: see text] be a graph. A vertex coloring [Formula: see text] of [Formula: see text] is called [Formula: see text]-vertex coloring if [Formula: see text] for every vertex [Formula: see text] of [Formula: see text], where [Formula: see text] is the set of colors of vertices adjacent to [Formula: see text]. Let [Formula: see text] be the maximum number of colors used in an [Formula: see text]-vertex coloring of [Formula: see text]. We provide some lower and upper bounds for [Formula: see text] in terms of girth, diameter or size of [Formula: see text]. Also, for every tree [Formula: see text], we obtain [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830918500076","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T01:21:46Z","timestamp":1510622506000},"page":"1850007","source":"Crossref","is-referenced-by-count":1,"title":["On N2-vertex coloring of graphs"],"prefix":"10.1142","volume":"10","author":[{"given":"S.","family":"Akbari","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Sharif University of Technology, Azadi Avenue, Tehran 11365, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9971-2179","authenticated-orcid":false,"given":"N.","family":"Alipourfard","sequence":"additional","affiliation":[{"name":"Information Sciences Institute, 4676 Admiralty Way, Marina Del Rey 90292, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Jandaghi","sequence":"additional","affiliation":[{"name":"Information Sciences Institute, 4676 Admiralty Way, Marina Del Rey 90292, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Mirtaheri","sequence":"additional","affiliation":[{"name":"Information Sciences Institute, 4676 Admiralty Way, Marina Del Rey 90292, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,2,14]]},"reference":[{"issue":"2","key":"S1793830918500076BIB001","first-page":"161","volume":"88","author":"Budajova K.","year":"2013","journal-title":"Int. J. Pure Appl. Math."},{"issue":"49","key":"S1793830918500076BIB002","first-page":"2437","volume":"5","author":"Czap J.","year":"2011","journal-title":"Appl. Math. Sci."},{"key":"S1793830918500076BIB003","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1842"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:11:44Z","timestamp":1565111504000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":3,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2018,2,14]]},"published-print":{"date-parts":[[2018,2]]}},"alternative-id":["10.1142\/S1793830918500076"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500076","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}