{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:59Z","timestamp":1759335539412},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"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":11581,"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":[[1981,11]]},"DOI":"10.1016\/0166-218x(81)90007-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"301-312","source":"Crossref","is-referenced-by-count":14,"title":["Complexity of representation of graphs by set systems"],"prefix":"10.1016","volume":"3","author":[{"given":"Svatopluk","family":"Poljak","sequence":"first","affiliation":[]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Turz\u00edk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(81)90007-X_BIB1","first-page":"17","article-title":"Derived graphs and digraphs","author":"Beineke","year":"1968","journal-title":"Beitr\u00e4ge zur Graphen-Theorie, Leipzig"},{"key":"10.1016\/0166-218X(81)90007-X_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"issue":"52","key":"10.1016\/0166-218X(81)90007-X_BIB3","first-page":"229","article-title":"Graphs repr\u00e9sentent des arces d'un multigraphe","volume":"9","author":"Bermond","year":"1973","journal-title":"J. Math. Pures Appl."},{"issue":"B","key":"10.1016\/0166-218X(81)90007-X_BIB4","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","article-title":"Intersection graphs of curves in the plane","volume":"21","author":"Erlich","year":"1976","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0166-218X(81)90007-X_BIB5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","article-title":"The representation of graphs by set intersections","volume":"18","author":"Erd\u00f6s","year":"1966","journal-title":"Canad. Math. J"},{"key":"10.1016\/0166-218X(81)90007-X_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/0166-218X(81)90007-X_BIB7","first-page":"77","article-title":"On colouring random graphs","author":"Grimmet","year":"1975","journal-title":"Math. Proc. Camb. Phil. Soc"},{"key":"10.1016\/0166-218X(81)90007-X_BIB8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math"},{"key":"10.1016\/0166-218X(81)90007-X_BIB9","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(81)90007-X_BIB10","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(81)90007-X_BIB11","series-title":"Complexity of Computer Computation","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(81)90007-X_BIB12","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4064\/fm-33-1-303-307","article-title":"Sur deux proprietes des classes d'ensembles","volume":"33","author":"Marzewski","year":"1945","journal-title":"Fund. Math"},{"key":"10.1016\/0166-218X(81)90007-X_BIB13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","article-title":"The NP-completeness of the bandwidth minimization problem","volume":"16","author":"Papadimitrou","year":"1976","journal-title":"Comput"},{"key":"10.1016\/0166-218X(81)90007-X_BIB14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(81)90065-0","article-title":"Set systems determined by intersections","volume":"34","author":"Poljak","year":"1981","journal-title":"Discrete Math"},{"key":"10.1016\/0166-218X(81)90007-X_BIB15","doi-asserted-by":"crossref","DOI":"10.1145\/359340.359346","article-title":"Covering edges by cliques with regard to keyword conflicts and intersection graphs","author":"Kou","year":"1978","journal-title":"Comm. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8190007X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8190007X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:23:14Z","timestamp":1555190594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X8190007X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["0166218X8190007X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(81)90007-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}