{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:23Z","timestamp":1720640783786},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00092-7","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T11:21:27Z","timestamp":1097839287000},"page":"478-484","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A Characteristic Approach to Bipartite Graphs and Incidence Graphs"],"prefix":"10.1016","volume":"11","author":[{"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00092-7_NEWBIB1","series-title":"Bipartite Graphs and their Applications","author":"Asratian","year":"1998"},{"key":"10.1016\/S1571-0653(04)00092-7_NEWBIB2","series-title":"Graph Classes: A Survey","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/S1571-0653(04)00092-7_NEWBIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(95)00070-8","article-title":"Incidence Graphs of Biacyclic Hypergraphs","volume":"68","author":"Dragan","year":"1996","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S1571-0653(04)00092-7_NEWBIB4","series-title":"Handbook of Combinatorics","first-page":"381","article-title":"Hypergraphs","author":"Duchet","year":"1995"},{"key":"10.1016\/S1571-0653(04)00092-7_NEWBIB5","first-page":"155","article-title":"Characteristic Parameters","volume":"24","author":"McKee","year":"1997","journal-title":"Chordal Graphs, and Common Neighborhoods, J. Combin. Math. Combin. Comp"},{"key":"10.1016\/S1571-0653(04)00092-7_NEWBIB6","first-page":"151","article-title":"Strong Clique Trees","volume":"33","author":"McKee","year":"2000","journal-title":"Neighborhood Trees, and Strongly Chordal Graphs, J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00092-7_NEWBIB7","series-title":"Topics in Intersection Graph Theory","author":"McKee","year":"1999"},{"key":"10.1016\/S1571-0653(04)00092-7_NEWBIB8","first-page":"631","article-title":"An approach to graph-theoretic homology","volume":"Vol 2","author":"McKee","year":"1999"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000927?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000927?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T21:54:31Z","timestamp":1549144471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304000927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":8,"alternative-id":["S1571065304000927"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00092-7","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}