{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:07Z","timestamp":1759639087088,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_21","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"261-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strong Cliques in Diamond-Free Graphs"],"prefix":"10.1007","author":[{"given":"Nina","family":"Chiarelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berenice","family":"Mart\u00ednez-Barona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Mur\u0161i\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.dam.2015.09.016","volume":"203","author":"L Alc\u00f3n","year":"2016","unstructured":"Alc\u00f3n, L., Gutierrez, M., Kov\u00e1cs, I., Milani\u010d, M., Rizzi, R.: Strong cliques and equistability of EPT graphs. Discret. Appl. Math. 203, 13\u201325 (2016)","journal-title":"Discret. Appl. Math."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.entcs.2019.08.003","volume":"346","author":"L Alc\u00f3n","year":"2019","unstructured":"Alc\u00f3n, L., Gutierrez, M., Milani\u010d, M.: A characterization of claw-free CIS graphs and new results on the order of CIS graphs. Electron. Notes Theoret. Comput. Sci. 346, 15\u201327 (2019)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"21_CR3","unstructured":"Alekseev, V.E.: On the number of maximal independent sets in graphs from hereditary classes. In: Combinatorial-Algebraic Methods in Discrete Optimization, pp. 5\u20138. University of Nizhny Novgorod (1991). (in Russian)"},{"issue":"5","key":"21_CR4","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/j.disc.2009.11.006","volume":"310","author":"DV Andrade","year":"2010","unstructured":"Andrade, D.V., Boros, E., Gurvich, V.: Not complementary connected and not CIS $$d$$-graphs form weakly monotone families. Discret. Math. 310(5), 1089\u20131096 (2010)","journal-title":"Discret. Math."},{"key":"21_CR5","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-94830-0_2","volume-title":"Optimization Problems in Graph Theory","author":"DV Andrade","year":"2018","unstructured":"Andrade, D.V., Boros, E., Gurvich, V.: On graphs whose maximal cliques and stable sets intersect. In: Goldengorin, B. (ed.) Optimization Problems in Graph Theory. SOIA, vol. 139, pp. 3\u201363. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94830-0_2"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230190206","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19(2), 247\u2013253 (1989)","journal-title":"Networks"},{"key":"21_CR7","series-title":"North-Holland Mathematics Studies","volume-title":"Topics on Perfect Graphs","year":"1984","unstructured":"Berge, C., Chv\u00e1tal, V. (eds.): Topics on Perfect Graphs. North-Holland Mathematics Studies, vol. 88. North-Holland Publishing Co., Amsterdam (1984)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Berge, C., Duchet, P.: Strongly perfect graphs. In: Topics on Perfect Graphs. North-Holland Mathematics Studies, vol. 88, pp. 57\u201361. North-Holland, Amsterdam (1984)","DOI":"10.1016\/S0304-0208(08)72922-0"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.disc.2013.11.015","volume":"318","author":"E Boros","year":"2014","unstructured":"Boros, E., Gurvich, V., Milani\u010d, M.: On CIS circulants. Discrete Math. 318, 78\u201395 (2014)","journal-title":"Discrete Math."},{"issue":"part 1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.dam.2015.07.023","volume":"216","author":"E Boros","year":"2017","unstructured":"Boros, E., Gurvich, V., Milani\u010d, M.: On equistable, split, CIS, and related classes of graphs. Discret. Appl. Math. 216(part 1), 47\u201366 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"4\u20135","key":"21_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.dam.2011.10.031","volume":"160","author":"A Brandst\u00e4dt","year":"2012","unstructured":"Brandst\u00e4dt, A., Giakoumakis, V., Maffray, F.: Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Discret. Appl. Math. 160(4\u20135), 471\u2013478 (2012)","journal-title":"Discret. Appl. Math."},{"key":"21_CR12","unstructured":"Cheston, G.A., Hare, E.O., Hedetniemi, S.T., Laskar, R.C.: Simplicial graphs. In: 1988 19th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Baton Rouge, LA, vol. 67, pp. 105\u2013113 (1988)"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.7155\/jgaa.00123","volume":"10","author":"GA Cheston","year":"2006","unstructured":"Cheston, G.A., Jap, T.S.: A survey of the algorithmic properties of simplicial, upper bound and middle graphs. J. Graph Algorithms Appl. 10(2), 159\u2013190 (2006)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1002\/jgt.21730","volume":"75","author":"M Chudnovsky","year":"2014","unstructured":"Chudnovsky, M.: The Erd\u00f6s-Hajnal conjecture-a survey. J. Graph Theor. 75(2), 178\u2013190 (2014)","journal-title":"J. Graph Theor."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jctb.2019.04.006","volume":"140","author":"M Chudnovsky","year":"2020","unstructured":"Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring graphs without induced paths on six vertices. J. Combin. Theory Ser. B 140, 45\u201383 (2020)","journal-title":"J. Combin. Theory Ser. B"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Slater, P.J.: A note on well-covered graphs. In: Quo Vadis, Graph Theory? Annals of Discrete Mathematics, vol. 55, pp. 179\u2013181. North-Holland, Amsterdam (1993)","DOI":"10.1016\/S0167-5060(08)70387-X"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.jcss.2017.06.005","volume":"89","author":"KK Dabrowski","year":"2017","unstructured":"Dabrowski, K.K., Dross, F., Paulusma, D.: Colouring diamond-free graphs. J. Comput. Syst. Sci. 89, 410\u2013431 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.jctb.2004.03.002","volume":"91","author":"X Deng","year":"2004","unstructured":"Deng, X., Li, G., Zang, W.: Proof of Chv\u00e1tal\u2019s conjecture on maximal stable sets and maximal cliques in graphs. J. Combin. Theor. Ser. B 91(2), 301\u2013325 (2004)","journal-title":"J. Combin. Theor. Ser. B"},{"issue":"part A","key":"21_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejc.2014.09.007","volume":"44","author":"E Dobson","year":"2015","unstructured":"Dobson, E., Hujdurovi\u0107, A., Milani\u010d, M., Verret, G.: Vertex-transitive CIS graphs. Eur. J. Combin. 44(part A), 87\u201398 (2015)","journal-title":"Eur. J. Combin."},{"issue":"1\u20132","key":"21_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(89)90045-0","volume":"25","author":"P Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P., Hajnal, A.: Ramsey-type theorems. Discret. Appl. Math. 25(1\u20132), 37\u201352 (1989). Combinatorics and complexity (Chicago, IL, 1987)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"21_CR21","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.dam.2010.11.014","volume":"159","author":"V Gurvich","year":"2011","unstructured":"Gurvich, V.: On exact blockers and anti-blockers, $$\\Delta $$-conjecture, and related problems. Discret. Appl. Math. 159(5), 311\u2013321 (2011)","journal-title":"Discret. Appl. Math."},{"key":"21_CR22","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-1-4614-7254-4_11","volume-title":"The Mathematics of Paul Erd\u0151s, II","author":"A Gy\u00e1rf\u00e1s","year":"1997","unstructured":"Gy\u00e1rf\u00e1s, A.: Reflections on a problem of Erd\u0151s and Hajnal. In: Graham, R.L., Nesetril, J. (eds.) The Mathematics of Paul Erd\u0151s, II. Algorithms and Combinatorics, vol. 14, pp. 93\u201398. Springer, New York (1997). https:\/\/doi.org\/10.1007\/978-1-4614-7254-4_11"},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0166-218X(94)90004-3","volume":"55","author":"CT Ho\u00e0ng","year":"1994","unstructured":"Ho\u00e0ng, C.T.: Efficient algorithms for minimum weighted colouring of some classes of perfect graphs. Discret. Appl. Math. 55(2), 133\u2013143 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"21_CR24","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1016\/j.disc.2018.02.013","volume":"341","author":"A Hujdurovi\u0107","year":"2018","unstructured":"Hujdurovi\u0107, A., Milani\u010d, M., Ries, B.: Graphs vertex-partitionable into strong cliques. Discret. Math. 341(5), 1392\u20131405 (2018)","journal-title":"Discret. Math."},{"issue":"9","key":"21_CR25","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1016\/j.disc.2019.06.010","volume":"342","author":"A Hujdurovi\u0107","year":"2019","unstructured":"Hujdurovi\u0107, A., Milani\u010d, M., Ries, B.: Detecting strong cliques. Discret. Math. 342(9), 2738\u20132750 (2019)","journal-title":"Discret. Math."},{"issue":"1","key":"21_CR26","first-page":"61","volume":"2","author":"M Kami\u0144ski","year":"2007","unstructured":"Kami\u0144ski, M., Lozin, V.: Coloring edges and vertices of graphs without short or long cycles. Contrib. Discret. Math. 2(1), 61\u201366 (2007)","journal-title":"Contrib. Discret. Math."},{"issue":"4","key":"21_CR27","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/s00373-018-1905-9","volume":"34","author":"T Karthick","year":"2018","unstructured":"Karthick, T., Mishra, S.: On the chromatic number of ($$P_6$$, diamond)-free graphs. Graphs Combin. 34(4), 677\u2013692 (2018)","journal-title":"Graphs Combin."},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-39890-5_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Kloks","year":"2003","unstructured":"Kloks, T., Lee, C.-M., Liu, J., M\u00fcller, H.: On the recognition of general partition graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 273\u2013283. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39890-5_24"},{"issue":"5","key":"21_CR29","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.jctb.2008.12.005","volume":"99","author":"T Kloks","year":"2009","unstructured":"Kloks, T., M\u00fcller, H., Vu\u0161kovi\u0107, K.: Even-hole-free graphs that do not contain diamonds: a structure theorem and its consequences. J. Combin. Theor. Ser. B 99(5), 733\u2013800 (2009)","journal-title":"J. Combin. Theor. Ser. B"},{"issue":"1\u20133","key":"21_CR30","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0012-365X(93)90512-R","volume":"113","author":"K McAvaney","year":"1993","unstructured":"McAvaney, K., Robertson, J., DeTemple, D.: A characterization and hereditary properties for partition graphs. Discret. Math. 113(1\u20133), 131\u2013142 (1993)","journal-title":"Discret. Math."},{"issue":"4","key":"21_CR31","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1002\/jgt.22040","volume":"84","author":"M Milani\u010d","year":"2017","unstructured":"Milani\u010d, M., Trotignon, N.: Equistarable graphs and counterexamples to three conjectures on equistable graphs. J. Graph Theor. 84(4), 536\u2013551 (2017)","journal-title":"J. Graph Theor."},{"key":"21_CR32","unstructured":"Prisner, E.: Graphs with few cliques. In: Alavi, Y., Schwenk, A. (eds.) Graph Theory, Combinatorics, and Algorithms: Proceedings of 7th Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University, pp. 945\u2013956. Wiley, New York (1995)"},{"issue":"3","key":"21_CR33","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230220304","volume":"22","author":"RS Sankaranarayana","year":"1992","unstructured":"Sankaranarayana, R.S., Stewart, L.K.: Complexity results for well-covered graphs. Networks 22(3), 247\u2013262 (1992)","journal-title":"Networks"},{"issue":"2","key":"21_CR34","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0166-218X(84)90067-2","volume":"7","author":"M Skowro\u0144ska","year":"1984","unstructured":"Skowro\u0144ska, M., Sys\u0142o, M.M.: An algorithm to recognize a middle graph. Discret. Appl. Math. 7(2), 201\u2013208 (1984)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"21_CR35","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"21_CR36","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(87)90048-7","volume":"42","author":"A Tucker","year":"1987","unstructured":"Tucker, A.: Coloring perfect $$(K_4-e)$$-free graphs. J. Combin. Theor. Ser. B 42, 313\u2013318 (1987)","journal-title":"J. Combin. Theor. Ser. B"},{"issue":"1\u20133","key":"21_CR37","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0012-365X(94)00019-F","volume":"143","author":"W Zang","year":"1995","unstructured":"Zang, W.: Generalizations of Grillet\u2019s theorem on maximal stable sets and maximal cliques in graphs. Discret. Math. 143(1\u20133), 259\u2013268 (1995)","journal-title":"Discret. Math."},{"issue":"8\u20139","key":"21_CR38","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.disc.2005.10.026","volume":"306","author":"I Zverovich","year":"2006","unstructured":"Zverovich, I., Zverovich, I.: Bipartite bihypergraphs: a survey and new results. Discret. Math. 306(8\u20139), 801\u2013811 (2006)","journal-title":"Discret. Math."}],"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-60440-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:02:00Z","timestamp":1710266520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","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":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","order":11,"name":"conference_url","label":"Conference URL","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","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":"32","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":"34% - 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.7","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":"2.1","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 virtually 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)"}}]}}