Alcón, Liliana; Gutierrez, Marisa; Kovács, István; Milanič, Martin; Rizzi, Romeo Strong cliques and equistability of EPT graphs. (English) Zbl 1332.05042 Discrete Appl. Math. 203, 13-25 (2016). MSC: 05C12 05C38 05C69 05C76 68Q17 PDFBibTeX XMLCite \textit{L. Alcón} et al., Discrete Appl. Math. 203, 13--25 (2016; Zbl 1332.05042) Full Text: DOI
Alcón, Liliana; Gutierrez, Marisa; Hurlbert, Glenn Pebbling in 2-paths. (English) Zbl 1347.05120 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 145-150, electronic only (2015). MSC: 05C57 05C82 90B20 68Q17 PDFBibTeX XMLCite \textit{L. Alcón} et al., Electron. Notes Discrete Math. 50, 145--150 (2015; Zbl 1347.05120) Full Text: DOI arXiv
Alcón, Liliana; Gutierrez, Marisa; Hurlbert, Glenn Pebbling in split graphs. (English) Zbl 1305.05215 SIAM J. Discrete Math. 28, No. 3, 1449-1466 (2014). MSC: 05C85 05C12 68Q17 90C35 PDFBibTeX XMLCite \textit{L. Alcón} et al., SIAM J. Discrete Math. 28, No. 3, 1449--1466 (2014; Zbl 1305.05215) Full Text: DOI arXiv Link
Alcón, L.; Gutierrez, M.; Mazzoleni, M. P. Recognizing vertex intersection graphs of paths on bounded degree trees. (English) Zbl 1300.05190 Discrete Appl. Math. 162, 70-77 (2014). MSC: 05C62 05C05 05C15 68Q17 PDFBibTeX XMLCite \textit{L. Alcón} et al., Discrete Appl. Math. 162, 70--77 (2014; Zbl 1300.05190) Full Text: DOI Link
Alcón, Liliana; Faria, Luerbio; de Figueiredo, Celina M. H.; Gutierrez, Marisa Split clique graph complexity. (English) Zbl 1416.68127 Theor. Comput. Sci. 506, 29-42 (2013). MSC: 68R10 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{L. Alcón} et al., Theor. Comput. Sci. 506, 29--42 (2013; Zbl 1416.68127) Full Text: DOI
Alcón, Liliana; Gutierrez, Marisa Finding intersection models: from chordal to Helly circular-arc graphs. (English) Zbl 1238.05179 Discrete Math. 312, No. 6, 1148-1157 (2012). MSC: 05C62 68R10 PDFBibTeX XMLCite \textit{L. Alcón} and \textit{M. Gutierrez}, Discrete Math. 312, No. 6, 1148--1157 (2012; Zbl 1238.05179) Full Text: DOI
Alcón, Liliana; Faria, Luerbio; de Figueiredo, Celina M. H.; Gutierrez, Marisa Split clique graph complexity. (English) Zbl 1341.05183 Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 11-22 (2011). MSC: 05C69 05C70 68Q17 PDFBibTeX XMLCite \textit{L. Alcón} et al., Lect. Notes Comput. Sci. 6986, 11--22 (2011; Zbl 1341.05183) Full Text: DOI Link
Faria, Luerbio [Alcón, Liliana; Ribero de Almeida, Aline; Brandstädt, Andreas; Pizanã, Miguel Algel; Szwarcfiter, Jayme Luiz] LAWCliques’2010 problem session. (English) Zbl 1247.05196 Mat. Contemp. 39, 1-8 (2010). MSC: 05C75 05C69 05C85 68R10 PDFBibTeX XMLCite \textit{L. Faria}, Mat. Contemp. 39, 1--8 (2010; Zbl 1247.05196)
Alcón, L.; Faria, L.; de Figueiredo, C. M. H.; Gutierrez, M. On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. (English) Zbl 1231.05193 Discrete Appl. Math. 158, No. 12, 1279-1285 (2010). MSC: 05C69 05C35 68W25 PDFBibTeX XMLCite \textit{L. Alcón} et al., Discrete Appl. Math. 158, No. 12, 1279--1285 (2010; Zbl 1231.05193) Full Text: DOI Link
Alcón, Liliana; Faria, Luerbio; de Figueiredo, Celina M. H.; Gutierrez, Marisa The complexity of clique graph recognition. (English) Zbl 1168.68015 Theor. Comput. Sci. 410, No. 21-23, 2072-2083 (2009). MSC: 68Q17 05C69 68R10 PDFBibTeX XMLCite \textit{L. Alcón} et al., Theor. Comput. Sci. 410, No. 21--23, 2072--2083 (2009; Zbl 1168.68015) Full Text: DOI Link
Alcón, L.; Faria, L.; de Figueiredo, C. M. H.; Gutierrez, M. On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. (English) Zbl 1341.05161 Liebling, Th. (ed.) et al., The IV Latin-American algorithms, graphs, and optimization symposium, Puerto Varas, Chile, November 25–29, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 30, 147-152 (2008). MSC: 05C60 05C69 68Q17 PDFBibTeX XMLCite \textit{L. Alcón} et al., Electron. Notes Discrete Math. 30, 147--152 (2008; Zbl 1341.05161) Full Text: DOI Link
Alcón, L.; Faria, L.; de Figueiredo, C. M. H.; Gutierrez, M. Clique graph recognition is NP-complete. (English) Zbl 1167.68403 Fomin, Fedor V. (ed.), Graph-theoretic concepts in computer science. 32nd international workshop, WG 2006, Bergen, Norway, June 22–24, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-48381-6/pbk). Lecture Notes in Computer Science 4271, 269-277 (2006). MSC: 68R10 05C69 68Q17 PDFBibTeX XMLCite \textit{L. Alcón} et al., Lect. Notes Comput. Sci. 4271, 269--277 (2006; Zbl 1167.68403) Full Text: DOI
Alcón, Liliana Clique-critical graphs: maximum size and recognition. (English) Zbl 1095.05025 Discrete Appl. Math. 154, No. 13, 1799-1802 (2006). MSC: 05C62 68R10 PDFBibTeX XMLCite \textit{L. Alcón}, Discrete Appl. Math. 154, No. 13, 1799--1802 (2006; Zbl 1095.05025) Full Text: DOI Link