{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T12:42:32Z","timestamp":1698064952153},"reference-count":17,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6305,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,7]]},"abstract":"Abstract<\/jats:title>A graph G<\/jats:italic> is strongly perfect if every induced subgraph H<\/jats:italic> of G<\/jats:italic> contains a stable set that meets all the maximal cliques of H.<\/jats:italic> We present a graph decomposition that preserves strong perfection: more precisely, a stitch decomposition of a graph G<\/jats:italic> = (V, E) is a partition of V<\/jats:italic> into nonempty disjoint subsets V1<\/jats:sub>, V2<\/jats:sub><\/jats:italic> such that in every P<\/jats:italic>4<\/jats:sub> with vertices in both V<\/jats:italic>i<\/jats:sub>apos;s, each of the three edges has an endpoint in V<\/jats:italic>1<\/jats:sub> and the other in V<\/jats:italic>2<\/jats:sub>.<\/jats:p>We give a good characterization of graphs that admit a stitch decomposition and establish several results concerning the stitch decomposition of strongly perfect graphs.<\/jats:p>","DOI":"10.1002\/jgt.3190130305","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:26:54Z","timestamp":1180182414000},"page":"301-311","source":"Crossref","is-referenced-by-count":2,"title":["A decomposition for strongly perfect graphs"],"prefix":"10.1002","volume":"13","author":[{"given":"Stephan","family":"Olariu","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"C.Berge F\u00e4rbung von Graphen deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind Wissenschaftliche Zeitung Martin\u2010Luther\u2010Univ.Halle Wittenberg Math. Natur Wiss. Reihe (1961)114\u2013115."},{"key":"e_1_2_1_3_2","article-title":"Topics on perfect graphs","volume":"21","author":"Berge C.","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_4_2","article-title":"Strongly perfect graphs","volume":"21","author":"Berge C.","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90049-8"},{"key":"e_1_2_1_6_2","article-title":"Perfectly ordered graphs","volume":"21","author":"Chv\u00e1tal V.","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_7_2","unstructured":"V.Chv\u00e1tal On theP4\u2010structure of perfect graphs: Sibling decompositions. McGill University Montreal School of Computer Science Technical Report SOCS\u201085.18."},{"key":"e_1_2_1_8_2","article-title":"A semi\u2010strong perfect graph conjecture","volume":"21","author":"Chv\u00e1tal V.","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_9_2","unstructured":"V.Chv\u00e1tal private communication (1986)."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90051-6"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70041-4"},{"key":"e_1_2_1_12_2","volume-title":"Burnside\u2010Raspail Workshop","author":"Duchet P.","year":"1986"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90052-8"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(76)80008-8"},{"key":"e_1_2_1_15_2","unstructured":"H.Meyniel A new property of critical imperfect graphs and some consequences. To appear."},{"key":"e_1_2_1_16_2","article-title":"A semi\u2010strong perfect graph theorem","author":"Reed B.","journal-title":"J. Combinat. Theory Ser. B"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90063-X"},{"key":"e_1_2_1_18_2","volume-title":"Theory of Games and Economic Behavior","author":"Von Neumann J.","year":"1944"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T13:27:55Z","timestamp":1697981275000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["10.1002\/jgt.3190130305"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130305","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}