乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T12:02:58Z","timestamp":1725105778625},"reference-count":22,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/0012-365x(95)00359-5","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"99-106","source":"Crossref","is-referenced-by-count":23,"title":["1-Tough cocomparability graphs are hamiltonian"],"prefix":"10.1016","volume":"170","author":[{"given":"Jitender S.","family":"Deogun","sequence":"first","affiliation":[]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"George","family":"Steiner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00359-5_BIB1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0012-365X(92)00047-U","article-title":"On the complexity of recognizing tough graphs","volume":"124","author":"Bauer","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00359-5_BIB2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(90)90001-S","article-title":"Recognizing tough graphs is NP-hard","volume":"28","author":"Bauer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(95)00359-5_BIB3","series-title":"Offprints from Graph Theory, Combinatorics, and Applications","first-page":"113","article-title":"Some recent results on long cycles in tough graphs","author":"Bauer","year":"1991"},{"key":"10.1016\/0012-365X(95)00359-5_BIB4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90055-M","article-title":"Long cycles in graphs with large degree sums","volume":"79","author":"Bauer","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00359-5_BIB5","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(95)00359-5_BIB6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and hamiltonian circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00359-5_BIB7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF00571188","article-title":"Finding hamiltonian paths in cocomparability graphs using the bump number algorithm","volume":"8","author":"Damaschke","year":"1992","journal-title":"Order"},{"key":"10.1016\/0012-365X(95)00359-5_BIB8","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1137\/S0097539791200375","article-title":"Polynomial algorithms for hamiltonian cycle in cocomparability graphs","volume":"23","author":"Deogun","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00359-5_BIB9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190090106","article-title":"Toughness and the existence of k-factors","volume":"9","author":"Enomoto","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00359-5_BIB10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00337617","article-title":"Computing the bump number is easy","volume":"5","author":"Habib","year":"1988","journal-title":"Order"},{"key":"10.1016\/0012-365X(95)00359-5_BIB11","doi-asserted-by":"crossref","unstructured":"C.T. Ho\u00e0ng, Hamiltonian degree conditions for tough graphs, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(93)E0214-O"},{"key":"10.1016\/0012-365X(95)00359-5_BIB12","article-title":"Hamiltonicity in graphs with few P4's","author":"Hochst\u00e4ttler","year":"1993","journal-title":"Rutcor Research Report 16-93"},{"key":"10.1016\/0012-365X(95)00359-5_BIB13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-5060(08)70503-X","article-title":"On maximal circuits in finite graphs","volume":"3","author":"Jung","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(95)00359-5_BIB14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","article-title":"On a class of posets and the corresponding comparability graphs","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(95)00359-5_BIB15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","article-title":"Finding hamiltonian circuits in interval graphs","volume":"20","author":"Keil","year":"1985","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0012-365X(95)00359-5_BIB16","article-title":"Computing the toughness and scattering number on interval and other graphs","author":"Kratsch","year":"1994"},{"key":"10.1016\/0012-365X(95)00359-5_BIB17","article-title":"Toughness, hamiltonicity and split graphs","author":"Kratsch","year":"1993"},{"key":"10.1016\/0012-365X(95)00359-5_BIB18","series-title":"The path partition of cocomparability graphs","author":"Lehel","year":"1991"},{"key":"10.1016\/0012-365X(95)00359-5_BIB19","unstructured":"R. Lin, S. Olariu and G. Pruesse, An optimal path cover for cographs, preprint."},{"key":"10.1016\/0012-365X(95)00359-5_BIB20","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(90)90025-S","article-title":"An optimum \u0398(n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals","volume":"35","author":"Manacher","year":"1990","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0012-365X(95)00359-5_BIB21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00337618","article-title":"Computing the bump number with techniques from two-processor scheduling","volume":"5","author":"Sch\u00e4ffer","year":"1988","journal-title":"Order"},{"key":"10.1016\/0012-365X(95)00359-5_BIB22","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1137\/0221061","article-title":"An O(n2 log n) algorithm for the hamiltonian cycle problem on circular-arc graphs","volume":"21","author":"Shih","year":"1992","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95003595?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95003595?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:27:02Z","timestamp":1553196422000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95003595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["0012365X95003595"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00359-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}