{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:05:14Z","timestamp":1648717514765},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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":[[2000,3]]},"DOI":"10.1016\/s0166-218x(99)00181-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"145-153","source":"Crossref","is-referenced-by-count":1,"title":["Pseudo-Hamiltonian-connected graphs"],"prefix":"10.1016","volume":"100","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00181-X_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0167-5060(08)70493-X","article-title":"Regularizable graphs","volume":"3","author":"Berge","year":"1978","journal-title":"Advances in graph theory, Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00181-X_BIB2","unstructured":"G. Chartrand, O.R. Oellermann, Applied and Algorithmic Graph Theory, McGraw-Hill, New York, 1993."},{"key":"10.1016\/S0166-218X(99)00181-X_BIB3","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\/S0166-218X(99)00181-X_BIB4","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\/S0166-218X(99)00181-X_BIB5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packing: structural properties and algorithms","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math. Program."},{"key":"10.1016\/S0166-218X(99)00181-X_BIB6","unstructured":"R. Nowakowski, personal communication."},{"key":"10.1016\/S0166-218X(99)00181-X_BIB7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01593772","article-title":"On the integer-valued variables in the linear vertex packing problem","volume":"12","author":"Picard","year":"1977","journal-title":"Math. Program."},{"key":"10.1016\/S0166-218X(99)00181-X_BIB8","first-page":"271","article-title":"The NP-completeness of the Hamiltonian cycle problem in bipartite cubic planar graphs","volume":"42\/43","author":"Plesnik","year":"1983","journal-title":"Acta Math. Uinv. Comen."},{"key":"10.1016\/S0166-218X(99)00181-X_BIB9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01588228","article-title":"Minimum node covers and 2-bicritical graphs","volume":"17","author":"Pulleyblank","year":"1979","journal-title":"Math. Program."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9900181X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9900181X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:55:26Z","timestamp":1556132126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9900181X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0166218X9900181X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00181-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}