{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:01:22Z","timestamp":1768723282024,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T00:00:00Z","timestamp":1592524800000},"content-version":"vor","delay-in-days":1479,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1016\/j.dam.2016.01.016","type":"journal-article","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T21:40:55Z","timestamp":1456004455000},"page":"65-72","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":45,"special_numbering":"C","title":["On <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>r<\/mml:mi><\/mml:math>-dynamic coloring of graphs"],"prefix":"10.1016","volume":"206","author":[{"given":"Sogol","family":"Jahanbekam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1411-4186","authenticated-orcid":false,"given":"Jaehoon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Suil","family":"O","sequence":"additional","affiliation":[]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2016.01.016_br000005","doi-asserted-by":"crossref","first-page":"3005","DOI":"10.1016\/j.dam.2009.05.002","article-title":"On the list dynamic coloring of graphs","volume":"157","author":"Akbari","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2016.01.016_br000010","series-title":"Combinatorics and Graphs","first-page":"1","article-title":"On the dynamic chromatic number of graphs","volume":"vol. 531","author":"Akbari","year":"2010"},{"key":"10.1016\/j.dam.2016.01.016_br000015","doi-asserted-by":"crossref","first-page":"2098","DOI":"10.1016\/j.dam.2012.05.017","article-title":"Dynamic chromatic number of regular graphs","volume":"160","author":"Alishahi","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2016.01.016_br000020","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.dam.2010.10.012","article-title":"On the dynamic coloring of graphs","volume":"159","author":"Alishahi","year":"2011","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2016.01.016_br000025","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0097-3165(78)90023-7","article-title":"A short proof of Kneser\u2019s conjecture","volume":"25","author":"B\u00e1r\u00e1ny","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.dam.2016.01.016_br000030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548313000515","article-title":"Semi-strong coloring of intersecting hypergraphs","volume":"23","author":"Blais","year":"2014","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2016.01.016_br000035","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On colouring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.dam.2016.01.016_br000040","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.dam.2015.01.020","article-title":"On r-dynamic coloring of grids","volume":"186","author":"Kang","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2016.01.016_br000045","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1016\/j.dam.2013.03.005","article-title":"Dynamic coloring and list dynamic coloring of planar graphs","volume":"161","author":"Kim","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2016.01.016_br000050","series-title":"Combinatorial Optimization and Applications","first-page":"156","article-title":"List dynamic coloring of sparse graphs","volume":"vol. 6831","author":"Kim","year":"2011"},{"key":"10.1016\/j.dam.2016.01.016_br000055","first-page":"193","article-title":"Upper bounds of dynamic chromatic number","volume":"68","author":"Lai","year":"2003","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2016.01.016_br000060","unstructured":"S. Loeb, T. Mahoney, B. Reiniger, J.I. Wise, Dynamically coloring graphs with given genus (2015) arXiv:1511.03983v1."},{"key":"10.1016\/j.dam.2016.01.016_br000065","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0095-8956(75)90089-1","article-title":"Three short proofs in graph theory","volume":"19","author":"Lov\u00e1sz","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2016.01.016_br000070","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","article-title":"Kneser\u2019s conjecture, chromatic number, and homotopy","volume":"25","author":"Lov\u00e1sz","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.dam.2016.01.016_br000075","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0012-365X(96)00249-X","article-title":"Hypergraph colouring and the Lov\u00e1sz local lemma","volume":"167\/268","author":"McDiarmid","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2016.01.016_br000080","series-title":"Dynamic coloring of graphs","author":"Montgomery","year":"2001"},{"key":"10.1016\/j.dam.2016.01.016_br000085","series-title":"Matchings, connectivity, and eigenvalues in regular graphs","author":"O","year":"2011"},{"key":"10.1016\/j.dam.2016.01.016_br000090","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.dam.2015.07.019","article-title":"r-dynamic chromatic number of graphs","volume":"201","author":"Taherkhani","year":"2016","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X16300038?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X16300038?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T01:08:36Z","timestamp":1592528916000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X16300038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":18,"alternative-id":["S0166218X16300038"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2016.01.016","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2016,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On -dynamic coloring of graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2016.01.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}