{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:11Z","timestamp":1740144491902,"version":"3.37.3"},"reference-count":35,"publisher":"EDP Sciences","issue":"6","license":[{"start":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T00:00:00Z","timestamp":1733443200000},"content-version":"vor","delay-in-days":35,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002923","name":"CONICET","doi-asserted-by":"crossref","award":["PIP 11220200100084CO"],"award-info":[{"award-number":["PIP 11220200100084CO"]}],"id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005363","name":"Universidad de Buenos Aires","doi-asserted-by":"publisher","award":["20020190100126BA"],"award-info":[{"award-number":["20020190100126BA"]}],"id":[{"id":"10.13039\/501100005363","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007351","name":"Secretaria de Ciencia y Tecnica, Universidad de Buenos Aires","doi-asserted-by":"publisher","award":["20020170100495BA"],"award-info":[{"award-number":["20020170100495BA"]}],"id":[{"id":"10.13039\/501100007351","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["309887\/2018-6"],"award-info":[{"award-number":["309887\/2018-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100020897","name":"Universidad Nacional de General Sarmiento","doi-asserted-by":"publisher","award":["30\/1135"],"award-info":[{"award-number":["30\/1135"]}],"id":[{"id":"10.13039\/100020897","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,10,16]]},"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p>A pendant vertex is one of degree one and an isolated vertex has degree zero. A neighborhood star-free (NSF for short) graph is one in which every vertex is contained in a triangle except pendant vertices and isolated vertices. This class has been considered before for several contexts. In the present paper, we study the complexity of the dominating induced matching (DIM) problem and the perfect edge domination (PED) problem for NSF graphs. We prove the corresponding decision problems are NP-Complete for several of its subclasses. As an added value of this study, we show three connected variants of planar positive 1in3SAT are also NP-Complete. Since these variants are more basic in complexity theory context than many graph problems, these results can be useful to prove that other problems are NP-Complete.<\/jats:p>","DOI":"10.1051\/ro\/2024198","type":"journal-article","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T18:47:16Z","timestamp":1729190836000},"page":"5063-5077","source":"Crossref","is-referenced-by-count":0,"title":["Graphs whose vertices of degree at least 2 lie in a triangle"],"prefix":"10.1051","volume":"58","author":[{"given":"Vinicius L.","family":"do Forte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5754-9761","authenticated-orcid":false,"given":"Min Chih","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Abilio","family":"Lucena","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3897-3356","authenticated-orcid":false,"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6954-4992","authenticated-orcid":false,"given":"Veronica A.","family":"Moyano","sequence":"additional","affiliation":[]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2024,12,6]]},"reference":[{"key":"R1","first-page":"1","volume":"2","author":"Brandenburg","year":"2023","journal-title":"Comput. Geom. Topol."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Brandst\u00a8adt A., Efficient domination and efficient edge domination: a brief survey, in Algorithms and Discrete Applied Mathematics. Vol. 10743 of Lecture Notes in Comput. Sci. Springer, Cham (2018) 1\u201314.","DOI":"10.1007\/978-3-319-74180-2_1"},{"key":"R3","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1007\/s00453-012-9709-4","volume":"68","author":"Brandst\u00a8adt","year":"2014","journal-title":"Algorithmica"},{"key":"R4","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1007\/s00453-016-0150-y","volume":"77","author":"Brandst\u00a8adt","year":"2017","journal-title":"Algorithmica"},{"key":"R5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.dam.2018.09.028","volume":"278","author":"Brandst\u00a8adt","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"R6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.dam.2020.01.028","volume":"283","author":"Brandst\u00a8adt","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"R7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.dam.2020.03.043","volume":"284","author":"Brandst\u00a8adt","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.7151\/dmgt.2336","volume":"42","author":"Brandst\u00a8adt","year":"2022","journal-title":"Discuss. Math. Graph Theory"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Brandst\u00a8adt A. and Nevries R., Efficient dominating and edge dominating sets for graphs and hypergraphs, in Encyclopedia of Algorithms. Springer (2016) 618\u2013621. DOI: 10.1007\/978-1-4939-2864-4689.","DOI":"10.1007\/978-1-4939-2864-4_689"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Brandst\u00a8adt A., Hundt C. and Nevries R., Efficient edge domination on hole-free graphs in polynomial time, in: LATIN 2010: Theoretical Informatics. Vol. 6034 of Lecture Notes in Comput. Sci. Springer, Berlin (2010) 650\u2013661.","DOI":"10.1007\/978-3-642-12200-2_56"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Brandst\u00a8adt A., Leitert A. and Rautenbach D., Efficient dominating and edge dominating sets for graphs and hypergraphs, in Algorithms and Computation \u2013 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19\u201321, 2012. Proceedings, Vol. 7676 of Lecture Notes in Computer Science, edited by Chao K., Hsu T. and Lee D.. Springer (2012) 267\u2013277.","DOI":"10.1007\/978-3-642-35261-4_30"},{"key":"R12","doi-asserted-by":"crossref","first-page":"3060","DOI":"10.1016\/j.dam.2008.01.021","volume":"156","author":"Cardoso","year":"2008","journal-title":"Discrete Appl. Math."},{"key":"R13","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.dam.2010.03.011","volume":"159","author":"Cardoso","year":"2011","journal-title":"Discrete Appl. Math."},{"key":"R14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0012-365X(03)00078-5","volume":"272","author":"Chartrand","year":"2003","journal-title":"Discret. Math."},{"key":"R15","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"Chiba","year":"1985","journal-title":"SIAM J. Comput."},{"key":"R16","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s11590-018-1335-x","volume":"14","author":"do Forte","year":"2020","journal-title":"Optim. Lett."},{"key":"R17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(93)90084-M","volume":"48","author":"Grinstead","year":"1993","journal-title":"Inf. Process. Lett."},{"key":"R18","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1002\/jgt.22182","volume":"88","author":"Hertz","year":"2018","journal-title":"J. Graph Theory"},{"key":"R19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jda.2013.11.002","volume":"26","author":"Korpelainen","year":"2014","journal-title":"J. Discrete Algorithms"},{"key":"R20","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(94)90026-4","volume":"133","author":"Kratochv\u00edl","year":"1994","journal-title":"Discrete Math."},{"key":"R21","unstructured":"Laroche P., Planar 1-in-3 satisfiability is NP-complete. ASMICSWorkshop on Tilings, Deuxi\u00e8me Journ\u00e9es Polyominos et pavages, Ecole Normale Sup\u00e9rieure de Lyon (1992)."},{"key":"R22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2011.12.006","volume":"426","author":"Lin","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"R23","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.ipl.2014.04.012","volume":"114","author":"Lin","year":"2014","journal-title":"Inf. Process. Lett."},{"key":"R24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.endm.2015.07.051","volume":"50","author":"Lin","year":"2015","journal-title":"Electron. Notes Discret. Math."},{"key":"R25","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1007\/s00453-015-0095-6","volume":"77","author":"Lin","year":"2017","journal-title":"Algorithmica"},{"key":"R26","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10479-017-2664-3","volume":"264","author":"Lin","year":"2018","journal-title":"Ann. Oper. Res."},{"key":"R27","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0166-218X(98)00057-2","volume":"87","author":"Lu","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"R28","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0166-218X(01)00198-6","volume":"119","author":"Lu","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"R29","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.dam.2005.05.021","volume":"154","author":"Markenzon","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"R30","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"Moore","year":"2001","journal-title":"Discrete Comput. Geom."},{"key":"R31","unstructured":"Moyano V., Edge dominating set problems: algorithms, bounds and properties. Ph.D. Thesis, Universidad de Buenos Aires (2017)."},{"key":"R32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"Mulzer","year":"2008","journal-title":"J. ACM"},{"key":"R33","unstructured":"Nevries R., Efficient domination and polarity. Ph.D. Thesis, University of Rostock (2014)."},{"key":"R34","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"Rose","year":"1974","journal-title":"Discrete Math."},{"key":"R35","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.dam.2015.04.012","volume":"191","author":"Xiao","year":"2015","journal-title":"Discrete Appl. Math."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024198\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T08:49:37Z","timestamp":1733474977000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":35,"journal-issue":{"issue":"6"},"alternative-id":["ro240227"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024198","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}