乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T13:19:28Z","timestamp":1695475168239},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0166-218x(94)90131-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"29-35","source":"Crossref","is-referenced-by-count":3,"title":["Graph homomorphisms with infinite targets"],"prefix":"10.1016","volume":"54","author":[{"given":"Gary","family":"MacGillivray","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90131-7_BIB1","series-title":"Proc. Twente Workshop on Graphs and Combinatorial Optimization","first-page":"13","article-title":"On the complexity of generalized colourings of directed graphs","author":"Bang-Jensen","year":"1989"},{"key":"10.1016\/0166-218X(94)90131-7_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(90)90017-7","article-title":"The effect of two cycles on the complexity of colourings by directed graphs","volume":"26","author":"Bang-Jensen","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90131-7_BIB3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0401029","article-title":"The complexity of colourings by semicomplete digraphs","volume":"1","author":"Bang-Jensen","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(94)90131-7_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0012-365X(92)90276-L","article-title":"On the complexity of colourings by superdigraphs of bipartite graphs","volume":"109","author":"Bang-Jensen","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90131-7_BIB5","first-page":"33","article-title":"Further effects of two directed cycles on the complexity of H-colouring","volume":"10","author":"Bang-Jensen","year":"1991","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0166-218X(94)90131-7_BIB6","first-page":"175","article-title":"On the complexity of colouring by digraphs with at most one directed cycle","volume":"35-A","author":"Bang-Jensen","year":"1993","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(94)90131-7_BIB7","unstructured":"B. Bauslaugh, The complexity of infinite H-colouring, Simon Fraser University, Burnaby, Canada, preprint."},{"key":"10.1016\/0166-218X(94)90131-7_BIB8","doi-asserted-by":"crossref","unstructured":"B. Bauslaugh, The complexity of colouring by infinite vertex-transitive graphs, Discrete Math., to appear.","DOI":"10.1016\/S0167-5060(08)70376-5"},{"key":"10.1016\/0166-218X(94)90131-7_BIB9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(91)90171-D","article-title":"A note on restricted H-colouring","volume":"40","author":"Brewster","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)90131-7_BIB10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(92)90294-K","article-title":"Polynomial graph colourings","volume":"35","author":"Gutjahr","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90131-7_BIB11","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-colouring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(94)90131-7_BIB12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(92)90282-K","article-title":"The core of a graph","volume":"109","author":"Hell","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90131-7_BIB13","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0404035","article-title":"The complexity of colouring by vertex-transitive and arc-transitive digraphs","volume":"4","author":"MacGillivray","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(94)90131-7_BIB14","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(81)90226-6","article-title":"On the complexity of the general colouring problem","volume":"51","author":"Maurer","year":"1981","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(94)90131-7_BIB15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(82)90129-3","article-title":"Colour families are dense","volume":"17","author":"Welzl","year":"1982","journal-title":"Theoret. Comput. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901317?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901317?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:28:58Z","timestamp":1555136938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0166218X94901317"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90131-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}