{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:08:45Z","timestamp":1743088125913,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_8","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"106-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complementation in T-perfect Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6927-438X","authenticated-orcid":false,"given":"Yixin","family":"Cao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8138-1911","authenticated-orcid":false,"given":"Shenghua","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"8_CR1","unstructured":"Benchetrit, Y.: Geometric properties of the chromatic number: polyhedra, structure and algorithms. Ph.D. thesis, Universit\u00e9 de Grenoble (2015)"},{"key":"8_CR2","first-page":"123","volume":"9","author":"C Berge","year":"1960","unstructured":"Berge, C.: Les problm\u00e8s de coloration en th\u00e9orie des graphes. Publ. Inst. Stat. Univ. Paris 9, 123\u2013160 (1960)","journal-title":"Publ. Inst. Stat. Univ. Paris"},{"key":"8_CR3","unstructured":"Berge, C.: Perfect graphs. In: Six Papers on Graph Theory, pp. 1\u201321. Indian Statistical Institute, Calcutta (1963)"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0012-365X(79)90160-2","volume":"27","author":"M Boulala","year":"1979","unstructured":"Boulala, M., Uhry, J.: Polytope des ind\u00e9pendants d\u2019un graphe s\u00e9rie-parall\u00e8le. Discrete Math. 27(3), 225\u2013243 (1979). https:\/\/doi.org\/10.1016\/0012-365X(79)90160-2","journal-title":"Discrete Math."},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1137\/16M1059874","volume":"31","author":"H Bruhn","year":"2017","unstructured":"Bruhn, H., Fuchs, E.: t-perfection in $$P_5$$-free graphs. SIAM J. Discrete Math. 31(3), 1616\u20131633 (2017). https:\/\/doi.org\/10.1137\/16M1059874","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/090769508","volume":"24","author":"H Bruhn","year":"2010","unstructured":"Bruhn, H., Stein, M.: t-perfection is always strong for claw-free graphs. SIAM J. Discrete Math. 24(3), 770\u2013781 (2010). https:\/\/doi.org\/10.1137\/090769508","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20132","key":"8_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-010-0436-9","volume":"133","author":"H Bruhn","year":"2012","unstructured":"Bruhn, H., Stein, M.: On claw-free t-perfect graphs. Math. Program. 133(1\u20132), 461\u2013480 (2012). https:\/\/doi.org\/10.1007\/s10107-010-0436-9","journal-title":"Math. Program."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006). https:\/\/doi.org\/10.4007\/annals.2006.164.51","journal-title":"Ann. Math."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Comb. Theory Ser. B 18, 138\u2013154 (1975). https:\/\/doi.org\/10.1016\/0095-8956(75)90041-6","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0012-365X(79)90114-6","volume":"26","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V., Graham, R.L., Perold, A.F., Whitesides, S.: Combinatorial designs related to the strong perfect graph conjecture. Discrete Math. 26(2), 83\u201392 (1979). https:\/\/doi.org\/10.1016\/0012-365X(79)90114-6","journal-title":"Discrete Math."},{"key":"8_CR11","unstructured":"Eisenbrand, F., Funke, S., Garg, N., K\u00f6nemann, J.: A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. In: SODA, pp. 517\u2013522 (2003)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-0208(08)72445-9","volume":"16","author":"J Fonlupt","year":"1982","unstructured":"Fonlupt, J., Uhry, J.: Transformations which preserve perfectness and h-perfectness of graphs. North-Holland Math. Stud. 16, 83\u201395 (1982). https:\/\/doi.org\/10.1016\/S0304-0208(08)72445-9","journal-title":"North-Holland Math. Stud."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0095-8956(89)90032-4","volume":"47","author":"AMH Gerards","year":"1989","unstructured":"Gerards, A.M.H.: A min-max relation for stable sets in graphs with no odd-$$K_{4}$$. J. Comb. Theory Ser. B 47, 330\u2013348 (1989). https:\/\/doi.org\/10.1016\/0095-8956(89)90032-4","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/S0895480196306361","volume":"11","author":"AMH Gerards","year":"1998","unstructured":"Gerards, A.M.H., Shepherd, F.B.: The graphs with all subgraphs t-perfect. SIAM J. Discrete Math. 11(4), 524\u2013545 (1998). https:\/\/doi.org\/10.1137\/S0895480196306361","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0095-8956(86)90087-0","volume":"40","author":"M Gr\u00f6tschel","year":"1986","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Relaxations of vertex packing. J. Comb. Theory Ser. B 40(3), 330\u2013343 (1986). https:\/\/doi.org\/10.1016\/0095-8956(86)90087-0","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2(3), 253\u2013267 (1972). https:\/\/doi.org\/10.1016\/0012-365X(72)90006-4","journal-title":"Discrete Math."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"GL Nemhauser","year":"1974","unstructured":"Nemhauser, G.L., Trotter, L.E., Jr.: Properties of vertex packing and independence system polyhedra. Math. Program. 6(1), 48\u201361 (1974). https:\/\/doi.org\/10.1007\/BF01580222","journal-title":"Math. Program."},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E., Jr.: Vertex packings: structural properties and algorithms. Math. Program. 8(1), 232\u2013248 (1975). https:\/\/doi.org\/10.1007\/BF01580444","journal-title":"Math. Program."},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01580235","volume":"6","author":"MW Padberg","year":"1974","unstructured":"Padberg, M.W.: Perfect zero-one matrices. Math. Program. 6(1), 180\u2013196 (1974). https:\/\/doi.org\/10.1007\/BF01580235","journal-title":"Math. Program."},{"key":"8_CR20","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01590960","volume":"71","author":"FB Shepherd","year":"1995","unstructured":"Shepherd, F.B.: Applying Lehman\u2019s theorems to packing problems. Math. Program. 71, 353\u2013367 (1995). https:\/\/doi.org\/10.1007\/BF01590960","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:01:52Z","timestamp":1702065712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}