乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T01:52:14Z","timestamp":1725155534541},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10878-016-0048-2","type":"journal-article","created":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T12:37:06Z","timestamp":1467117426000},"page":"1443-1453","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The (vertex-)monochromatic index of a graph"],"prefix":"10.1007","volume":"33","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[]},{"given":"Di","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. The Macmillan Press, London"},{"key":"48_CR2","doi-asserted-by":"publisher","unstructured":"Cai Q, Li X, Wu D (2015a) Erd\u00f6s\u2013Gallai-type results for colorful monochromatic connectivity of a graph. J Comb Optim. doi: 10.1007\/s10878-015-9938-y , in press","DOI":"10.1007\/s10878-015-9938-y"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Cai Q, Li X, Wu D (2015b) Some extremal results on the colorful monochromatic vertex-connectivity of a graph. arXiv:1503.08941","DOI":"10.1007\/s10878-015-9938-y"},{"issue":"1","key":"48_CR4","doi-asserted-by":"crossref","first-page":"R57","DOI":"10.37236\/781","volume":"15","author":"Y Caro","year":"2008","unstructured":"Caro Y, Lev A, Roditty Y, Tuza Z, Yuster R (2008) On rainbow connection. Electron J Combin 15(1):R57","journal-title":"Electron J Combin"},{"key":"48_CR5","doi-asserted-by":"crossref","first-page":"1786","DOI":"10.1016\/j.disc.2011.04.020","volume":"311","author":"Y Caro","year":"2011","unstructured":"Caro Y, Yuster R (2011) Colorful monochromatic connectivity. Discrete Math 311:1786\u20131792","journal-title":"Discrete Math"},{"key":"48_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"G Chartrand","year":"2008","unstructured":"Chartrand G, Johns G, McKeon K, Zhang P (2008) Rainbow connection in graphs. Math Bohem 133:85\u201398","journal-title":"Math Bohem"},{"key":"48_CR7","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1007\/s00373-012-1183-x","volume":"29","author":"L Chen","year":"2013","unstructured":"Chen L, Li X, Lian H (2013) Nordhaus\u2013Gaddum-type theorem for rainbow connection number of graphs. Graphs Combin 29:1235\u20131247","journal-title":"Graphs Combin"},{"key":"48_CR8","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York"},{"key":"48_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(94)00373-Q","volume":"155","author":"F Harary","year":"1996","unstructured":"Harary F, Haynes TW (1996) Nordhaus\u2013Gaddum inequalities for domination in graphs. Discrete Math 155:99\u2013105","journal-title":"Discrete Math"},{"issue":"3","key":"48_CR10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M Krivelevich","year":"2010","unstructured":"Krivelevich M, Yuster R (2010) The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J Graph Theory 63(3):185\u2013191","journal-title":"J Graph Theory"},{"key":"48_CR11","first-page":"291","volume":"48","author":"R Laskar","year":"1985","unstructured":"Laskar R, Peters K (1985) Vertex and edge domination parameters in graphs. Congr Numer 48:291\u2013305","journal-title":"Congr Numer"},{"key":"48_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li X, Shi Y, Sun Y (2013) Rainbow connections of graphs: a survey. Graphs Combin 29:1\u201338","journal-title":"Graphs Combin"},{"key":"48_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow connections of graphs. Springer briefs in math","author":"X Li","year":"2012","unstructured":"Li X, Sun Y (2012) Rainbow connections of graphs. Springer briefs in math. Springer, New York"},{"key":"48_CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"EA Nordhaus","year":"1956","unstructured":"Nordhaus EA, Gaddum JW (1956) On complementary graphs. Am Math Monthly 63:175\u2013177","journal-title":"Am Math Monthly"},{"key":"48_CR15","first-page":"189","volume":"54","author":"L Zhang","year":"2005","unstructured":"Zhang L, Wu B (2005) The Nordhaus\u2013Gaddum-type inequalities of some chemical indices. MATCH Commun Math Comput Chem 54:189\u2013194","journal-title":"MATCH Commun Math Comput Chem"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0048-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0048-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0048-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0048-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T23:29:58Z","timestamp":1718666998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0048-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["48"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0048-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,28]]}}}