乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:36:12Z","timestamp":1726472172074},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NNSF of China","doi-asserted-by":"publisher","award":["11671232","12071260"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"NSF of Shandong Province","doi-asserted-by":"publisher","award":["ZR2017MA018"],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1016\/j.dam.2020.11.010","type":"journal-article","created":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T13:34:04Z","timestamp":1605965644000},"page":"302-312","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Packing a number of copies of a (<\/mml:mo>p<\/mml:mi>,<\/mml:mo>q<\/mml:mi>)<\/mml:mo><\/mml:mrow><\/mml:math>-graph"],"prefix":"10.1016","volume":"289","author":[{"given":"Yun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jin","family":"Yan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2020.11.010_b1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1112\/jlms\/s2-48.1.39","article-title":"Embedding arbitrary graphs of maximum degree two","volume":"48","author":"Aigner","year":"1993","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.dam.2020.11.010_b2","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1137\/120902719","article-title":"On the tree packing conjecture","volume":"27","author":"Balogh","year":"2013","journal-title":"SIAM J. Discrete Math."},{"year":"1978","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/j.dam.2020.11.010_b3"},{"key":"10.1016\/j.dam.2020.11.010_b4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(83)90254-6","article-title":"Some remarks on packing trees","volume":"46","author":"Bollob\u00e1s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0095-8956(78)90030-8","article-title":"Packings of graphs and applications to computational complexity","volume":"25","author":"Bollob\u00e1s","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2020.11.010_b6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jctb.2007.05.002","article-title":"Packing d-degenerate graphs","volume":"98","author":"Bollob\u00e1s","year":"2008","journal-title":"J. Combin. Theory Ser. B"},{"year":"2008","series-title":"Graph Theory","author":"Bondy","key":"10.1016\/j.dam.2020.11.010_b7"},{"key":"10.1016\/j.dam.2020.11.010_b8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/jgt.3190010308","article-title":"Every (p,p\u22122) graph is contained in its complement","volume":"1","author":"Burns","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2020.11.010_b9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF02761996","article-title":"Embedding (p,p\u22121)-graph in their complements","volume":"30","author":"Burns","year":"1978","journal-title":"Israel J. Math."},{"key":"10.1016\/j.dam.2020.11.010_b10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.endm.2017.06.038","article-title":"Packing two graphs of even girth 10","volume":"61","author":"Cames Van\u00a0Batenburg","year":"2017","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b11","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1017\/S0963548318000032","article-title":"Packing graphs of bounded codegree","volume":"27","author":"Cames Van\u00a0Batenburg","year":"2018","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2020.11.010_b12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(90)90209-Z","article-title":"A note on packing trees into complete bipartite graphs and on Fishburn\u2019s conjecture","volume":"82","author":"Caro","year":"1990","journal-title":"Discrete Math."},{"year":"1976","series-title":"Embedding Subgraphs and Coloring Graphs under Extremal Degree Conditions","author":"Catlin","key":"10.1016\/j.dam.2020.11.010_b13"},{"key":"10.1016\/j.dam.2020.11.010_b14","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1017\/S0963548307008395","article-title":"On the Bollob\u00e1s-Eldridge conjecture for bipartite graphs","volume":"16","author":"Csaba","year":"2007","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2020.11.010_b15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00493-003-0013-4","article-title":"Proof of a conjecture of Bollob\u00e1s and Eldridge for graphs of maximum degree three","volume":"23","author":"Csaba","year":"2003","journal-title":"Combinatorica"},{"key":"10.1016\/j.dam.2020.11.010_b16","doi-asserted-by":"crossref","first-page":"569","DOI":"10.7151\/dmgt.1628","article-title":"Generalizations of the tree packing conjecture","volume":"32","author":"Gerbner","year":"2012","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2020.11.010_b17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.7151\/dmgt.1735","article-title":"Packing trees into n-chromatic graphs","volume":"34","author":"Gy\u00e1rf\u00e1s","year":"2014","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2020.11.010_b18","series-title":"Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976)","first-page":"463","article-title":"Packing trees of different order into Kn","volume":"Vol. I","author":"Gy\u00e1rf\u00e1s","year":"1978"},{"key":"10.1016\/j.dam.2020.11.010_b19","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.disc.2016.03.001","article-title":"A list version of graph packing","volume":"339","author":"Gy\u0151ri","year":"2016","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b20","first-page":"323","article-title":"Packing four copies of a tree into a complete graph","volume":"59","author":"Haler","year":"2014","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.dam.2020.11.010_b21","first-page":"149","article-title":"A note on packing two trees into Kn","volume":"11","author":"Hedetniemi","year":"1981","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2020.11.010_b22","first-page":"63","article-title":"Packing trees","volume":"33","author":"Hobbs","year":"1981","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2020.11.010_b23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0012-365X(87)90164-6","article-title":"Packing trees in complete graphs","volume":"67","author":"Hobbs","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b24","doi-asserted-by":"crossref","first-page":"3573","DOI":"10.4171\/JEMS\/909","article-title":"Optimal packings of bounded degree trees","volume":"21","author":"Joos","year":"2019","journal-title":"J. Eur. Math. Soc."},{"key":"10.1016\/j.dam.2020.11.010_b25","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0012-365X(00)00443-X","article-title":"On the packing of three graphs","volume":"236","author":"Kheddouci","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b26","doi-asserted-by":"crossref","first-page":"2785","DOI":"10.1016\/j.disc.2016.05.023","article-title":"On a packing problem of Alon and Yuster","volume":"339","author":"Kostochka","year":"2016","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b27","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","article-title":"Edge disjoint placement of graphs","volume":"25","author":"Sauer","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2020.11.010_b28","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/eujc.1993.1018","article-title":"Packing three copies of a tree into a complete graph","volume":"14","author":"Wang","year":"1993","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2020.11.010_b29","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/(SICI)1097-0118(199601)21:1<71::AID-JGT10>3.0.CO;2-V","article-title":"Packing three copies of a graph","volume":"21","author":"Wang","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2020.11.010_b30","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0012-365X(03)00296-6","article-title":"Packing of graphs and permutations-a survey","volume":"276","author":"Wo\u017aniak","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01195330","article-title":"Triple placement of graphs","volume":"9","author":"Wo\u017aniak","year":"1993","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2020.11.010_b32","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0012-365X(88)90232-4","article-title":"Packing of graphs-a survey","volume":"72","author":"Yap","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b33","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0012-365X(96)00014-3","article-title":"On packing trees into complete bipartite graphs","volume":"163","author":"Yuster","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b34","doi-asserted-by":"crossref","first-page":"2634","DOI":"10.1016\/j.disc.2011.08.002","article-title":"A note on k-placeable graphs","volume":"311","author":"\u017bak","year":"2011","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b35","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.disc.2016.07.022","article-title":"Packing large trees of consecutive orders","volume":"340","author":"\u017bak","year":"2017","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.11.010_b36","series-title":"Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing","first-page":"643","article-title":"Decomposition of graphs into trees","author":"Zaks","year":"1977"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20304972?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20304972?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T05:27:04Z","timestamp":1607405224000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X20304972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":36,"alternative-id":["S0166218X20304972"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2020.11.010","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Packing a number of copies of a -graph","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2020.11.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}