{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:32:00Z","timestamp":1699835520181},"reference-count":6,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9072,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1981,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We find a necessary and sufficient condition for a graph <jats:italic>H<\/jats:italic> to be the clique graph of some graph <jats:italic>G<\/jats:italic> without multicliqual edges. We also give a characterization of graphs without multicliqual edges that have a unique critical generator. Finally, it is shown that there are infinitely many self\u2010clique graphs having more than one critical generator.<\/jats:p>","DOI":"10.1002\/jgt.3190050416","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:42:48Z","timestamp":1180420968000},"page":"443-451","source":"Crossref","is-referenced-by-count":16,"title":["On Graphs Without Multicliqual Edges"],"prefix":"10.1002","volume":"5","author":[{"given":"Lim","family":"Chong\u2010Keang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Yee\u2010Hock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90084-7"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_4_2","series-title":"Lecture Notes in Math.","first-page":"157","volume-title":"Recent Trends in Graph. Theory","author":"Hedetniemi S. T.","year":"1970"},{"key":"e_1_2_1_5_2","volume-title":"Graph Theory and Applications (Proc. Conf)","author":"Hedetniemi S. T.","year":"1972"},{"key":"e_1_2_1_5_3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0067365"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90070-0"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190050416","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190050416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T06:22:58Z","timestamp":1699770178000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190050416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["10.1002\/jgt.3190050416"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190050416","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}