乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:00:10Z","timestamp":1740106810703,"version":"3.37.3"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-1266016"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["12-01-00631","12-01-00448"],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11171129"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Doctoral Fund of Ministry of Education of China","doi-asserted-by":"publisher","award":["20130144110001"],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Development and Promotion of Science and Technology Talents Project"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-1266016","DMS 08-38434"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11101125"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Funds for Universities in Henan"},{"DOI":"10.13039\/100000001","name":"NSA","doi-asserted-by":"publisher","award":["H98230-12-1-0226"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1016\/j.ejc.2015.07.002","type":"journal-article","created":{"date-parts":[[2015,7,25]],"date-time":"2015-07-25T19:00:19Z","timestamp":1437850819000},"page":"380-397","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"special_numbering":"C","title":["Strong chromatic index of subcubic planar multigraphs"],"prefix":"10.1016","volume":"51","author":[{"given":"A.V.","family":"Kostochka","sequence":"first","affiliation":[]},{"given":"X.","family":"Li","sequence":"additional","affiliation":[]},{"given":"W.","family":"Ruksasakchai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2299-6964","authenticated-orcid":false,"given":"M.","family":"Santana","sequence":"additional","affiliation":[]},{"given":"T.","family":"Wang","sequence":"additional","affiliation":[]},{"given":"G.","family":"Yu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2015.07.002_br000005","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","article-title":"The strong chromatic index of a cubic graph is at most 10","volume":"108","author":"Andersen","year":"1992","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.ejc.2015.07.002_br000010","doi-asserted-by":"crossref","first-page":"759","DOI":"10.7151\/dmgt.1708","article-title":"Precise upper bound for the strong edge chromatic number of sparse planar graphs","volume":"33","author":"Borodin","year":"2013","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.ejc.2015.07.002_br000015","unstructured":"H. Bruhn, F. Joos, A stronger bound for the strong chromatic index, arXiv:1504.02583 \u00a0[math.CO]."},{"key":"10.1016\/j.ejc.2015.07.002_br000020","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(88)90196-3","article-title":"Problems and results in combinatorial analysis and graph theory","volume":"72","author":"Erd\u0151s","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2015.07.002_br000025","series-title":"Irregularities of Partitions","first-page":"161","article-title":"[Problem]","author":"Erd\u0151s","year":"1989"},{"key":"10.1016\/j.ejc.2015.07.002_br000030","first-page":"205","article-title":"The strong chromatic index of graphs","volume":"29B","author":"Faudree","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/j.ejc.2015.07.002_br000035","first-page":"141","article-title":"Strong edge-coloring of graphs and applications to multi-k-gons","volume":"16A","author":"Fouquet","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/j.ejc.2015.07.002_br000040","series-title":"Progress in Graph Theory (Waterloo 1982)","first-page":"247","article-title":"Strong edge-coloring of cubic planar graphs","author":"Fouquet","year":"1984"},{"key":"10.1016\/j.ejc.2015.07.002_br000045","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representatives of subsetes","volume":"10","author":"Hall","year":"1935","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.ejc.2015.07.002_br000050","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.disc.2013.10.009","article-title":"Induced matchings in subcubic graphs without short cycles","volume":"315\u2013316","author":"Henning","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2015.07.002_br000055","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1016\/j.dam.2013.05.021","article-title":"On strong edge-colouring of subcubic graphs","volume":"161","author":"Hocquard","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ejc.2015.07.002_br000060","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.1016\/j.dam.2011.06.015","article-title":"Strong edge colouring of subcubic graphs","volume":"159","author":"Hocquard","year":"2011","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ejc.2015.07.002_br000065","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/jgt.3190170204","article-title":"Induced matchings in cubic graphs","volume":"17","author":"Hor\u00e1k","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2015.07.002_br000070","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.disc.2014.02.002","article-title":"Strong edge-coloring of planar graphs","volume":"324","author":"Hud\u00e1k","year":"2014","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.ejc.2015.07.002_br000075","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1137\/130944424","article-title":"Induced matchings in subcubic graphs","volume":"28","author":"Joos","year":"2014","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.ejc.2015.07.002_br000080","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1137\/100808824","article-title":"Induced matchings in subcubic planar graphs","volume":"26","author":"Kang","year":"2012","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ejc.2015.07.002_br000085","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/jctb.1997.1724","article-title":"A bound on the strong chromatic index of a graph","volume":"69","author":"Molloy","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2015.07.002_br000090","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.disc.2013.11.005","article-title":"The strong chromatic index of graphs and subdivisions","volume":"317","author":"Nakprasit","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2015.07.002_br000095","doi-asserted-by":"crossref","unstructured":"T. Nandagopal, T. Kim, X. Gao, V. Bharghavan, Achieving MAC layer fairness in wireless packet networks, in: Proc. 6th ACM Conf. on Mobile Computing and Networking, 2000, pp. 87\u201398.","DOI":"10.1145\/345910.345925"},{"key":"10.1016\/j.ejc.2015.07.002_br000100","unstructured":"S. Ramanathan, A unified framework and algorithm for (T\/F\/C) DMA channel assignment in wireless networks, in: Proc. IEEE INFOCOM\u201997, 1997, pp. 900\u2013907."},{"key":"10.1016\/j.ejc.2015.07.002_br000105","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(93)90590-P","article-title":"On induced matchings","volume":"120","author":"Steger","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2015.07.002_br000110","doi-asserted-by":"crossref","first-page":"6254","DOI":"10.1016\/j.disc.2007.11.051","article-title":"The strong chromatic index of a class of graphs","volume":"308","author":"Wu","year":"2008","journal-title":"Discrete Math."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669815001687?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669815001687?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T20:34:51Z","timestamp":1655670891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669815001687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":22,"alternative-id":["S0195669815001687"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2015.07.002","relation":{},"ISSN":["0195-6698"],"issn-type":[{"type":"print","value":"0195-6698"}],"subject":[],"published":{"date-parts":[[2016,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strong chromatic index of subcubic planar multigraphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2015.07.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}