乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T23:58:12Z","timestamp":1720051092615},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T00:00:00Z","timestamp":1611964800000},"content-version":"vor","delay-in-days":1490,"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":[[2017,1]]},"DOI":"10.1016\/j.dam.2016.09.017","type":"journal-article","created":{"date-parts":[[2016,9,25]],"date-time":"2016-09-25T04:02:02Z","timestamp":1474776122000},"page":"175-184","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"P2","title":["Harmonious colourings of graphs"],"prefix":"10.1016","volume":"217","author":[{"given":"Ewa","family":"Drgas-Burchardt","sequence":"first","affiliation":[]},{"given":"Katarzyna","family":"Gibek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.dam.2016.09.017_br000005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/9","article-title":"On harmonious colourings of trees","volume":"19","author":"Aflaki","year":"2012","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2016.09.017_br000010","first-page":"221","article-title":"Harmonious chromatic number of central graph of complete graph families","volume":"32","author":"Akbar","year":"2007","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"10.1016\/j.dam.2016.09.017_br000015","first-page":"57","article-title":"On harmonious coloring of total graphs of C(Cn), C(K1,n) and C(Pn)","volume":"29","author":"Akbar","year":"2010","journal-title":"Proyecciones"},{"key":"10.1016\/j.dam.2016.09.017_br000020","doi-asserted-by":"crossref","first-page":"1633","DOI":"10.1016\/j.disc.2012.02.009","article-title":"Harmonious coloring of trees with large maximum degree","volume":"312","author":"Akbari","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2016.09.017_br000025","doi-asserted-by":"crossref","first-page":"2377","DOI":"10.1016\/j.dam.2007.07.005","article-title":"The harmonious coloring problem is NP-complete for interval and permutation graphs","volume":"155","author":"Asdre","year":"2007","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2016.09.017_br000030","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.tcs.2007.05.012","article-title":"NP-completeness results for some problems on subclasses of bipartite and chordal graphs","volume":"381","author":"Asdre","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2016.09.017_br000035","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1017\/S0963548300001462","article-title":"The harmonious chromatic number of almost all trees","volume":"4","author":"Edwards","year":"1995","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2016.09.017_br000040","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0012-365X(99)00020-5","article-title":"The harmonious chromatic number of complete r-ary trees","volume":"203","author":"Edwards","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2016.09.017_br000045","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/jgt.3190180305","article-title":"New upper bounds on harmonious colorings","volume":"18","author":"Edwards","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2016.09.017_br000050","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(94)00100-R","article-title":"The complexity of harmonious colouring for trees","volume":"57","author":"Edwards","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2016.09.017_br000055","first-page":"241","article-title":"The line-distinguishing chromatic number of a graph","volume":"14","author":"Frank","year":"1982","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2016.09.017_br000060","series-title":"Graph-Theoretic Concepts in Computer Science, Proceedings of 34th International Workshop, WG 2008 (Durham, UK)","first-page":"183","article-title":"Evaluations of graph polynomials","volume":"vol. 5344","author":"Godlin","year":"2008"},{"key":"10.1016\/j.dam.2016.09.017_br000065","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0604032","article-title":"On the harmonious coloring of graphs","volume":"4","author":"Hopcroft","year":"1983","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"10.1016\/j.dam.2016.09.017_br000070","series-title":"On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph","author":"Immelman","year":"2007"},{"key":"10.1016\/j.dam.2016.09.017_br000075","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-5060(08)70623-X","article-title":"The harmonious chromatic number of a graph","volume":"51","author":"Kundrik","year":"1992","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.dam.2016.09.017_br000080","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/jgt.3190150402","article-title":"On an upper bound for the harmonious chromatic number of a graph","volume":"15","author":"Lu","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2016.09.017_br000085","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Amer. Math. Monthly"},{"issue":"2","key":"10.1016\/j.dam.2016.09.017_br000090","doi-asserted-by":"crossref","first-page":"153","DOI":"10.5556\/j.tkjm.43.2012.675","article-title":"Harmonious coloring of double star graph families","volume":"43","author":"Venkatachalam","year":"2012","journal-title":"Tamkang J. Math."},{"key":"10.1016\/j.dam.2016.09.017_br000095","series-title":"Introduction to Graph Theory","author":"West","year":"2001"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X16304097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X16304097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T08:15:16Z","timestamp":1611994516000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X16304097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":19,"alternative-id":["S0166218X16304097"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2016.09.017","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Harmonious colourings 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.09.017","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}