Bulteau, Laurent; Dabrowski, Konrad K.; Köhler, Noleen; Ordyniak, Sebastian; Paulusma, Daniël 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 \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 13453, 114--128 (2022; Zbl 07682405) Full Text: DOI arXiv
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. (English) Zbl 1522.05362 J. Graph Theory 98, No. 1, 81-109 (2021). MSC: 05C70 05C62 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Graph Theory 98, No. 1, 81--109 (2021; Zbl 1522.05362) Full Text: DOI arXiv OA License
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. (English) Zbl 1400.68078 Theor. Comput. Sci. 746, 36-48 (2018). MSC: 68Q25 05C70 68Q17 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Theor. Comput. Sci. 746, 36--48 (2018; Zbl 1400.68078) Full Text: DOI
Dabrowski, Konrad K.; Paulusma, Daniël On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs. (English) Zbl 1476.68200 Inf. Process. Lett. 134, 35-41 (2018). MSC: 68R10 05C15 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{K. K. Dabrowski} and \textit{D. Paulusma}, Inf. Process. Lett. 134, 35--41 (2018; Zbl 1476.68200) Full Text: DOI arXiv
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 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). MSC: 68R10 05C15 05C70 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Bonamy} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 70, 14 p. (2017; Zbl 1441.68167) Full Text: DOI
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton 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). MSC: 68R10 05C69 05C70 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Lect. Notes Comput. Sci. 10043, 423--437 (2016; Zbl 1483.68247) Full Text: DOI arXiv Link
Dabrowski, Konrad K.; Lozin, Vadim V.; Stacho, Juraj Stable-\(\Pi\) partitions of graphs. (English) Zbl 1306.05189 Discrete Appl. Math. 182, 104-114 (2015). MSC: 05C70 05C75 68Q17 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Discrete Appl. Math. 182, 104--114 (2015; Zbl 1306.05189) Full Text: DOI