Brause, Christoph; Golovach, Petr; Martin, Barnaby; Ochem, Pascal; Paulusma, Daniël; Smith, Siani Acyclic, star, and injective colouring: bounding the diameter. (English) Zbl 1491.05074 Electron. J. Comb. 29, No. 2, Research Paper P2.43, 29 p. (2022). MSC: 05C15 05C78 05C85 05C12 05C45 PDFBibTeX XMLCite \textit{C. Brause} et al., Electron. J. Comb. 29, No. 2, Research Paper P2.43, 29 p. (2022; Zbl 1491.05074) Full Text: DOI
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani 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 \textit{C. Brause} et al., Lect. Notes Comput. Sci. 12911, 336--348 (2021; Zbl 07538588) Full Text: DOI arXiv
Chaplick, Steven; Golovach, Petr A.; Hartmann, Tim A.; Knop, Dušan Recognizing proper tree-graphs. (English) Zbl 07764099 Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 8, 15 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{S. Chaplick} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 8, 15 p. (2020; Zbl 07764099) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. Subgraph complementation. (English) Zbl 1439.05212 Algorithmica 82, No. 7, 1859-1880 (2020). MSC: 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 82, No. 7, 1859--1880 (2020; Zbl 1439.05212) Full Text: DOI arXiv
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
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in claw-free graphs. (English) Zbl 1311.05090 SIAM J. Discrete Math. 29, No. 1, 348-375 (2015). MSC: 05C38 05C85 68R10 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., SIAM J. Discrete Math. 29, No. 1, 348--375 (2015; Zbl 1311.05090) Full Text: DOI arXiv Link
Golovach, Petr A.; Paulusma, Daniël; Song, Jian Coloring graphs without short cycles and long induced paths. (English) Zbl 1284.05098 Discrete Appl. Math. 167, 107-120 (2014). MSC: 05C15 05C38 05C60 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Discrete Appl. Math. 167, 107--120 (2014; Zbl 1284.05098) Full Text: DOI
Golovach, Petr A.; Lidický, Bernard; Martin, Barnaby; Paulusma, Daniël Finding vertex-surjective graph homomorphisms. (English) Zbl 1253.68149 Acta Inf. 49, No. 6, 381-394 (2012). MSC: 68Q17 05C60 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Acta Inf. 49, No. 6, 381--394 (2012; Zbl 1253.68149) Full Text: DOI Link
Golovach, Petr A.; Paulusma, Daniël; Song, Jian Computing vertex-surjective homomorphisms to partially reflexive trees. (English) Zbl 1251.05031 Theor. Comput. Sci. 457, 86-100 (2012). MSC: 05C05 05C60 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 457, 86--100 (2012; Zbl 1251.05031) Full Text: DOI
Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Induced packing of odd cycles in planar graphs. (English) Zbl 1232.68064 Theor. Comput. Sci. 420, 28-35 (2012). MSC: 68Q17 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 420, 28--35 (2012; Zbl 1232.68064) Full Text: DOI
Golovach, Petr A.; Paulusma, Daniël; Song, Jian 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 \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 6651, 261--274 (2011; Zbl 1332.68073) Full Text: DOI Link
Golovach, Petr; Kratochvíl, Jan Computational complexity of generalized domination: A complete dichotomy for chordal graphs. (English) Zbl 1141.68530 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). Lecture Notes in Computer Science 4769, 1-11 (2007). MSC: 68R10 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{P. Golovach} and \textit{J. Kratochvíl}, Lect. Notes Comput. Sci. 4769, 1--11 (2007; Zbl 1141.68530) Full Text: DOI