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
Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. (English) Zbl 1380.68219 Theor. Comput. Sci. 705, 75-83 (2018). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 705, 75--83 (2018; Zbl 1380.68219) Full Text: DOI arXiv Link
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
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony 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). MSC: 68R10 05C15 05C60 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 10307, 270--281 (2017; Zbl 1489.68192) Full Text: DOI arXiv Link
Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian A survey on the computational complexity of coloring graphs with forbidden subgraphs. (English) Zbl 1359.05039 J. Graph Theory 84, No. 4, 331-363 (2017). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Graph Theory 84, No. 4, 331--363 (2017; Zbl 1359.05039) Full Text: DOI arXiv Link
Johnson, Matthew; Patel, Viresh; Paulusma, Daniël; Trunck, Théophile Obtaining online ecological colourings by generalizing first-fit. (English) Zbl 1380.68454 Theory Comput. Syst. 54, No. 2, 244-260 (2014). MSC: 68W27 05C15 05C85 PDFBibTeX XMLCite \textit{M. Johnson} et al., Theory Comput. Syst. 54, No. 2, 244--260 (2014; Zbl 1380.68454) Full Text: DOI Link
Johnson, Matthew; Paulusma, Daniël; Wood, Chantal Path factors and parallel knock-out schemes of almost claw-free graphs. (English) Zbl 1219.05140 Discrete Math. 310, No. 9, 1413-1423 (2010). MSC: 05C70 05C38 05C35 PDFBibTeX XMLCite \textit{M. Johnson} et al., Discrete Math. 310, No. 9, 1413--1423 (2010; Zbl 1219.05140) Full Text: DOI Link