×

Found 13 Documents (Results 1–13)

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

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

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field