乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T08:26:17Z","timestamp":1726475177267},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1016\/j.endm.2017.10.041","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T15:47:42Z","timestamp":1509032862000},"page":"237-242","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["On the (di)graphs with (directed) proper connection number two"],"prefix":"10.1016","volume":"62","author":[{"given":"Guillaume","family":"Ducoffe","sequence":"first","affiliation":[]},{"given":"Ruxandra","family":"Marinescu-Ghemeci","sequence":"additional","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2017.10.041_br0010","first-page":"189","article-title":"On proper-path colorings in graphs","volume":"97","author":"Andrews","year":"2016","journal-title":"J. Comb. Math. Comb. Comp."},{"key":"10.1016\/j.endm.2017.10.041_br0020","doi-asserted-by":"crossref","first-page":"2550","DOI":"10.1016\/j.disc.2011.09.003","article-title":"Proper connection of graphs","volume":"312","author":"Borozan","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.endm.2017.10.041_br0030","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s10878-009-9250-9","article-title":"Hardness and algorithms for rainbow connection","volume":"21","author":"Chakraborty","year":"2011","journal-title":"J. Comb. Optim."},{"author":"Chang","key":"10.1016\/j.endm.2017.10.041_br0040"},{"key":"10.1016\/j.endm.2017.10.041_br0050","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","article-title":"Rainbow connection in graphs","volume":"133","author":"Chartrand","year":"2008","journal-title":"Math. Bohem."},{"key":"10.1016\/j.endm.2017.10.041_br0060","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.akcej.2016.06.003","article-title":"Note on vertex and total proper connection numbers","volume":"13","author":"Chizmar","year":"2016","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"10.1016\/j.endm.2017.10.041_br0070","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0166-218X(92)00171-H","article-title":"Hamiltonian circuits determining the order of chromosomes","volume":"50","author":"Dorninger","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.endm.2017.10.041_br0080","doi-asserted-by":"crossref","first-page":"683","DOI":"10.4310\/JOC.2012.v3.n4.a6","article-title":"Proper connection with many colors","volume":"3","author":"Gerek","year":"2012","journal-title":"J. Combin."},{"key":"10.1016\/j.endm.2017.10.041_br0090","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.tcs.2015.10.017","article-title":"Proper connection number of random graphs","volume":"609","author":"Gu","year":"2016","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.endm.2017.10.041_br0100","article-title":"Minimum degree condition for proper connection number 2","author":"Huang","year":"2017","journal-title":"Theoret. Comput. Sci."},{"author":"Huang","key":"10.1016\/j.endm.2017.10.041_br0110"},{"key":"10.1016\/j.endm.2017.10.041_br0120","doi-asserted-by":"crossref","DOI":"10.20429\/tag.2015.000102","article-title":"Properly colored notions of connectivity-a dynamic survey","author":"Li","year":"2015","journal-title":"Theory Appl. Graphs"},{"key":"10.1016\/j.endm.2017.10.041_br0130","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.tcs.2015.06.006","article-title":"Proper connection number and connected dominating sets","volume":"607","author":"Li","year":"2015","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.endm.2017.10.041_br0140","doi-asserted-by":"crossref","first-page":"439","DOI":"10.7151\/dmgt.1867","article-title":"Characterizations of graphs having large proper connection numbers","volume":"36","author":"Lumduanhom","year":"2016","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.endm.2017.10.041_br0150","first-page":"58","article-title":"Directed proper connection of graphs","volume":"68","author":"Magnant","year":"2016","journal-title":"\u041c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u0447\u043a\u0438 \u0412\u0435\u0441\u043d\u0438\u043a"},{"key":"10.1016\/j.endm.2017.10.041_br0160","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/1097-0118(200009)35:1<46::AID-JGT4>3.0.CO;2-W","article-title":"Even dicycles","volume":"35","author":"McCuaig","year":"2015","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.endm.2017.10.041_br0170","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","article-title":"A note on finding the bridges of a graph","volume":"2","author":"Tarjan","year":"1974","journal-title":"Inform. Process. Lett."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065317302809?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065317302809?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T15:11:45Z","timestamp":1603206705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065317302809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":17,"alternative-id":["S1571065317302809"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2017.10.041","relation":{},"ISSN":["1571-0653"],"issn-type":[{"type":"print","value":"1571-0653"}],"subject":[],"published":{"date-parts":[[2017,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the (di)graphs with (directed) proper connection number two","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2017.10.041","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}