{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T13:56:02Z","timestamp":1715694962201},"reference-count":7,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6492,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A 2\u2010threshold graph is defined to be the edge\u2010union of two threshold graphs. We prove that all chordless cycles of size at least 5 and their complements are forbidden for 2\u2010threshold graphs. We also obtain a sufficient condition for a 2\u2010threshold graph to be a comparability graph. Finally, we show that 2\u2010threshold graphs can have at most three cutpoints and obtain efficient algorithms to recognize, decompose and obtain a maximum stable set of 2\u2010threshold graphs with exactly three cutpoints.<\/jats:p>","DOI":"10.1002\/net.3230190103","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T01:47:49Z","timestamp":1178934469000},"page":"17-23","source":"Crossref","is-referenced-by-count":7,"title":["Some properties of 2\u2010threshold graphs"],"prefix":"10.1002","volume":"19","author":[{"given":"P. L.","family":"Hammer","sequence":"first","affiliation":[]},{"given":"N. V. R.","family":"Mahadev","sequence":"additional","affiliation":[]},{"given":"U. N.","family":"Peled","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graphs and Hypergraphs","author":"Berge C.","year":"1973"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70731-3"},{"key":"e_1_2_1_4_2","unstructured":"M. B.CozzensandR.Leibowitz private communication."},{"key":"e_1_2_1_5_2","volume-title":"Graph algorithms","author":"Even S.","year":"1979"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0606049"},{"key":"e_1_2_1_7_2","first-page":"241","article-title":"Sufficient conditions for graphs to have threshold number 2","volume":"11","author":"Ibaraki T.","year":"1981","journal-title":"Ann. Discr. Math."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0603036"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T09:17:07Z","timestamp":1697966227000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["10.1002\/net.3230190103"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190103","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}