{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T07:00:31Z","timestamp":1697612431377},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf02253613","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T11:39:39Z","timestamp":1132054779000},"page":"213-225","source":"Crossref","is-referenced-by-count":9,"title":["Hamiltonicity in graphs with fewP 4's"],"prefix":"10.1007","volume":"54","author":[{"given":"W.","family":"Hochst\u00e4ttler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Tinhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02253613_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough graphs and Hamiltonian circuits. Discrete Math.5, 215\u2013228 (1973).","journal-title":"Discrete Math."},{"key":"BF02253613_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"Corneil, D. G., Lerch, H., Stewart, L.: Complement reducible graphs. Discr. Appl. Math.3, 163\u2013185 (1981).","journal-title":"Discr. Appl. Math."},{"key":"BF02253613_CR3","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. Ch. Golumbic","year":"1980","unstructured":"Golumbic, M. Ch.: Algorithmic graph theory and perfect graphs. New York: Academic Press 1980."},{"key":"BF02253613_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","volume":"81","author":"R. Jamison","year":"1989","unstructured":"Jamison, R., Olariu, S.:P 4-reducible graphs\u2014a class of uniquely tree-representable graphs. Stud. Appl. Math.81, 79\u201387 (1989).","journal-title":"Stud. Appl. Math."},{"key":"BF02253613_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90085-B","volume":"34","author":"R. Jamison","year":"1991","unstructured":"Jamison, R., Olariu, S.: On a unique tree representation forP 4-extendible graphs. Discr. Appl. Math.34, 151\u2013164 (1991).","journal-title":"Discr. Appl. Math."},{"key":"BF02253613_CR6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"R. Jamison","year":"1992","unstructured":"Jamison, R., Olariu, S.: A unique tree representation forP 4-sparse graphs. Discr. Appl. Math.35, 115\u2013129 (1992).","journal-title":"Discr. Appl. Math."},{"key":"BF02253613_CR7","series-title":"Proceedings of the 18th Annual Workshop on Graph Theoretic Concepts in CS","volume-title":"P-components and the homogeneous decomposition of graphs","author":"R. Jamison","year":"1994","unstructured":"Jamison, R., Olariu, S.: P-components and the homogeneous decomposition of graphs. Proceedings of the 18th Annual Workshop on Graph Theoretic Concepts in CS. Springer Lecture Notes in CS (Mayr, E. ed.). Berlin Heidelberg New York Tokyo: Springer 1994."},{"key":"BF02253613_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"H. A. Jung","year":"1978","unstructured":"Jung, H. A.: On a class of posets and the corresponding comparability graphs. Journal of Comb. Theor. Ser.B 24, 125\u2013133 (1978).","journal-title":"Journal of Comb. Theor. Ser. B"},{"key":"BF02253613_CR9","unstructured":"Lin, R., Olariu, S., Pruesse, G.: An optimal path cover for cographs (Submitted)."},{"key":"BF02253613_CR10","unstructured":"Lin, R., Olariu, S., Schwing, J. L., Zhang, J.: An efficient EREW algorithm for minimum path cover and Hamiltonicity on cographs. (Submitted)."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253613.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02253613\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T10:52:27Z","timestamp":1558003947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02253613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF02253613"],"URL":"https:\/\/doi.org\/10.1007\/bf02253613","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}