{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:25:56Z","timestamp":1710339956405},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":6102,"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":[[1996,11]]},"DOI":"10.1016\/0012-365x(95)00107-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"155-160","source":"Crossref","is-referenced-by-count":9,"title":["Structural conditions for cycle completable graphs"],"prefix":"10.1016","volume":"159","author":[{"given":"Charles R.","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terry A.","family":"McKee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00107-8_BIB1","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/S0895479893249757","article-title":"The Euclidean distance matrix comletion problem","volume":"16","author":"Bakonyi","year":"1995","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/0012-365X(95)00107-8_BIB2","unstructured":"W. Barrett, C.R. Johnson and R. Loewy, The real positive definite completion problem: cycle completability, to appear."},{"key":"10.1016\/0012-365X(95)00107-8_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(93)90234-F","article-title":"The real positive definite completion problem for a simple cycle","volume":"192","author":"Barrett","year":"1993","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0012-365X(95)00107-8_BIB4","series-title":"Graph Theory and Sparse Matrix Computations","first-page":"1","article-title":"An introduction to chordal graphs and clique trees","volume":"Vol. 56","author":"Blair","year":"1993"},{"key":"10.1016\/0012-365X(95)00107-8_BIB5","series-title":"Graph decompositions: A Study in Infinite Graph Theory","author":"Diestel","year":"1990"},{"key":"10.1016\/0012-365X(95)00107-8_BIB6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0012-365X(95)00107-8_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","article-title":"Positive definite completions of partial hermitian matrices","volume":"58","author":"Grone","year":"1984","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0012-365X(95)00107-8_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/03081089508818392","article-title":"The Euclidean distance completion problem: cycle completability","volume":"39","author":"Johnson","year":"1995","journal-title":"Linear and Multilinear Algebra"},{"key":"10.1016\/0012-365X(95)00107-8_BIB9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(93)90510-Z","article-title":"Optimal decomposition by complete separators","volume":"113","author":"Leimer","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00107-8_BIB10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/jgt.3190070206","article-title":"Series-parallel graphs: a logical approach","volume":"7","author":"McKee","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00107-8_BIB11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/jgt.3190170210","article-title":"On the chordality of a graph","volume":"17","author":"McKee","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00107-8_BIB12","series-title":"Theory of Graphs","author":"Ore","year":"1962"},{"key":"10.1016\/0012-365X(95)00107-8_BIB13","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acylicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00107-8_BIB14","first-page":"1","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1979"},{"key":"10.1016\/0012-365X(95)00107-8_BIB15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","article-title":"Steiner trees, partial 2-trees, and minimum IFI networks","volume":"13","author":"Wald","year":"1983","journal-title":"Networks"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95001078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95001078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:25:46Z","timestamp":1555968346000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95001078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0012365X95001078"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00107-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}