×

Found 34 Documents (Results 1–34)

An algorithmic framework for locally constrained homomorphisms. (English) Zbl 07682405

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, 114-128 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Acyclic, star, and injective colouring: bounding the diameter. (English) Zbl 07538588

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 336-348 (2021).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Injective colouring for H-free graphs. (English) Zbl 07493522

Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 18-30 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Acyclic, star and injective colouring: a complexity picture for \(H\)-free graphs. (English) Zbl 07651161

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 22, 22 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Disconnected cuts in claw-free graphs. (English) Zbl 1524.05256

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 61, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Recognizing graphs close to bipartite graphs. (English) Zbl 1441.68167

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 70, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Surjective \(H\)-colouring: new hardness results. (English) Zbl 1489.68192

Kari, Jarkko (ed.) et al., Unveiling dynamics and complexity. 13th conference on computability in Europe, CiE 2017, Turku, Finland, June 12–16, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10307, 270-281 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Computing vertex-surjective homomorphisms to partially reflexive trees. (English) Zbl 1332.68073

Kulikov, Alexander (ed.) et al., Computer science – theory and applications. 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20711-2/pbk). Lecture Notes in Computer Science 6651, 261-274 (2011).
MSC:  68Q25 05C05 05C60
PDFBibTeX XMLCite
Full Text: DOI Link

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

Main Field

Software