×

Found 11 Documents (Results 1–11)

Extending partial representations of circular-arc graphs. (English) Zbl 07682413

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 230-243 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Gaps in full homomorphism order. (English) Zbl 1378.05134

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 429-435 (2017).
MSC:  05C60
PDFBibTeX XMLCite
Full Text: DOI arXiv

An universality argument for graph homomorphisms. (English) Zbl 1346.05190

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 643-649, electronic only (2015).
MSC:  05C60 20C99
PDFBibTeX XMLCite
Full Text: DOI

Comparing universal covers in polynomial time. (English) Zbl 1142.68456

Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. Third international computer science symposium in Russia, CSR 2008 Moscow, Russia, June 7–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79708-1/pbk). Lecture Notes in Computer Science 5010, 158-167 (2008).
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software