×

Found 89 Documents (Results 1–89)

On the geodetic and hull numbers of shadow graphs. (English) Zbl 1456.05051

Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 167-177 (2020).
MSC:  05C12 05C38
PDFBibTeX XMLCite
Full Text: DOI

On the computational complexity of the Helly number in the \(P_3\) and related convexities. (English) Zbl 07515188

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 285-297 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI

The geodetic hull number is hard for chordal graphs. (English) Zbl 1383.05064

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 291-296 (2017).
MSC:  05C10 05C12 05C38
PDFBibTeX XMLCite
Full Text: DOI arXiv

Geodetic convexity parameters for graphs with few short induced paths. (English) Zbl 1417.05204

Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 25-37 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Complexity of determining the maximum infection time in the geodetic convexity. (English) Zbl 1347.05041

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, 403-408, electronic only (2015).
PDFBibTeX XMLCite
Full Text: DOI

On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques. (English) Zbl 1347.05124

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, 361-366, electronic only (2015).
PDFBibTeX XMLCite
Full Text: DOI

On \(f\)-reversible processes on graphs. (English) Zbl 1347.05182

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, 231-236, electronic only (2015).
PDFBibTeX XMLCite
Full Text: DOI

Inapproximability results for graph convexity parameters. (English) Zbl 1416.68132

Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5–6, 2013. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8447, 97-107 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Connected greedy colourings. (English) Zbl 1405.68126

Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 433-441 (2014).
MSC:  68Q17 05C15
PDFBibTeX XMLCite
Full Text: DOI

Firefighting with general weights. (English) Zbl 1305.05218

Nešetřil, Jaroslav (ed.) et al., The seventh European conference on combinatorics, graph theory and applications. Extended abstracts of EuroComb 2013, Pisa, Italy, September 9–13, 2013. Pisa: Edizioni della Normale (ISBN 978-88-7642-474-8/pbk; 978-88-7642-475-5/ebook). Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 16, 619-620 (2013).
PDFBibTeX XMLCite

The Carathéodory number of the \(P_3\) convexity of chordal graphs. (English) Zbl 1294.05067

Nešetřil, Jaroslav (ed.) et al., The seventh European conference on combinatorics, graph theory and applications. Extended abstracts of EuroComb 2013, Pisa, Italy, September 9–13, 2013. Pisa: Edizioni della Normale (ISBN 978-88-7642-474-8/pbk; 978-88-7642-475-5/ebook). Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 16, 209-214 (2013).
MSC:  05C12 52A99
PDFBibTeX XMLCite

The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects. (English) Zbl 1309.05171

Nešetřil, Jaroslav (ed.) et al., The seventh European conference on combinatorics, graph theory and applications. Extended abstracts of EuroComb 2013, Pisa, Italy, September 9–13, 2013. Pisa: Edizioni della Normale (ISBN 978-88-7642-474-8/pbk; 978-88-7642-475-5/ebook). Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 16, 135-139 (2013).
PDFBibTeX XMLCite

On the Radon number for \(P _{3}\)-convexity. (English) Zbl 1353.68280

Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 267-278 (2012).
PDFBibTeX XMLCite
Full Text: DOI

On the Carathéodory number for the convexity of paths of order three. (English) Zbl 1274.05460

Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 105-110 (2011).
MSC:  05C99 52A37
PDFBibTeX XMLCite
Full Text: Link

Forbidden subgraphs and the Kőnig property. (English) Zbl 1268.05156

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 333-338 (2011).
MSC:  05C70
PDFBibTeX XMLCite
Full Text: DOI

The colorful Helly property for hypergraphs. (English) Zbl 1273.05154

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 647-651 (2009).
MSC:  05C65 05C85
PDFBibTeX XMLCite
Full Text: DOI

Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals. (English) Zbl 1268.05046

Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 323-328 (2009).
MSC:  05C05 05C85
PDFBibTeX XMLCite
Full Text: DOI

On the convexity of paths of length two in undirected graphs. (English) Zbl 1267.05248

Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 11-18 (2009).
MSC:  05C85
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of the geodetic and convexity numbers of a graph. (English) Zbl 1168.05033

Balakrishnan, R. (ed.) et al., Proceedings of the international conference on discrete mathematics (ICDM 2006), Bangalore, India, December 15–18, 2006. Mysore: Ramanujan Mathematical Society (ISBN 978-81-902545-7-1/hbk). Ramanujan Mathematical Society Lecture Notes Series 7, 101-108 (2008).
MSC:  05C35 05C38
PDFBibTeX XMLCite

Algorithmic aspects of monophonic convexity. (English) Zbl 1341.05133

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, 177-182 (2008).
MSC:  05C38 05C85 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Convex partitions of graphs. (English) Zbl 1341.05198

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 147-151 (2007).
MSC:  05C70 05C69 68Q17
PDFBibTeX XMLCite
Full Text: DOI

The Helly property on subhypergraphs. (English) Zbl 1203.05113

Feofiloff, Paulo (ed.) et al., Proceedings of GRACO2005. Papers from the 2nd Brazilian symposium on graphs, algorithms, and combinatorics, Angra dos Reis, Brazil, April 27–29, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 19, 71-77 (2005).
MSC:  05C65 05C60 68Q25
PDFBibTeX XMLCite

Characterization and recognition of generalized clique-Helly graphs. (English) Zbl 1112.05321

Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21–23, 2004. Revised papers. Berlin: Springer (ISBN 3-540-24132-9/pbk). Lecture Notes in Computer Science 3353, 344-354 (2004).
MSC:  05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field