×

Found 7 Documents (Results 1–7)

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

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

On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. (English) Zbl 1483.68247

Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 423-437 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field