×

Found 50 Documents (Results 1–50)

A characterization of claw-free CIS graphs and new results on the order of CIS graphs. (English) Zbl 07515165

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, 15-27 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Neighbor-locating coloring: graph operations and extremal cardinalities. (English) Zbl 1397.05065

Garijo, Delia (ed.) et al., Discrete mathematics days 2018. Extended abstracts of the 11th “Jornadas de matemática discreta y algorítmica” (JMDA), Sevilla, Spain, June 27–29, 2018. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 68, 131-136 (2018).
MSC:  05C15 05C76
PDFBibTeX XMLCite
Full Text: DOI Link

On the existence of critical clique-Helly graphs. (English) Zbl 1383.05224

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, 231-236 (2017).
MSC:  05C69
PDFBibTeX XMLCite
Full Text: DOI Link

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. (English) Zbl 1347.05128

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, 249-254, electronic only (2015).
MSC:  05C62 05C38 05C85
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

On containment graphs of paths in a tree. (English) Zbl 1347.05099

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, 175-180, electronic only (2015).
MSC:  05C38 05C05 06A07
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs. (English) Zbl 1268.05167

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, 81-86 (2011).
MSC:  05C75
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI Link

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
Full Text: DOI Link

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
Full Text: DOI

Non loop graphs with induced cycles. (English) Zbl 1200.05187

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, 289-295 (2005).
MSC:  05C75 05C38
PDFBibTeX XMLCite

Tree loop graphs. (English) Zbl 1075.05591

Liebling, T. (ed.) et al., Latin-American conference on combinatorics, graphs and applications. Papers from the conference, Santiago, Chile, August 16–20, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 18, 17-23 (2004).
MSC:  05C75
PDFBibTeX XMLCite
Full Text: Link

Clique-critical graphs. (English) Zbl 1075.05570

Liebling, T. (ed.) et al., Latin-American conference on combinatorics, graphs and applications. Papers from the conference, Santiago, Chile, August 16–20, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 18, 11-15 (2004).
MSC:  05C69
PDFBibTeX XMLCite
Full Text: Link

Clique planar graphs. (English) Zbl 0981.05087

Szwarcfiter, Jayme (ed.), Proceedings of the Brazilian symposium on graphs, algorithms and combinatorics, Fortaleza, Ceará, Brazil, March 17-19, 2001. Extended abstracts. Amsterdam: Elsevier, Electron. Notes Discrete Math. 7, no pag., electronic only (2001).
MSC:  05C75 05C10 05C69
PDFBibTeX XMLCite

Filter Results by …

Database

all top 5

Year of Publication

all top 3

Main Field