Alecu, Bogdan; Lozin, Vadim; Malyshev, Dmitriy Critical properties of bipartite permutation graphs. (English) Zbl 07783191 J. Graph Theory 105, No. 1, 34-60 (2024). MSC: 05C60 05A05 PDFBibTeX XMLCite \textit{B. Alecu} et al., J. Graph Theory 105, No. 1, 34--60 (2024; Zbl 07783191) Full Text: DOI arXiv OA License
Jaffke, Lars; Jansen, Bart M. P. Fine-grained parameterized complexity analysis of graph coloring problems. (English) Zbl 07640726 Discrete Appl. Math. 327, 33-46 (2023). MSC: 68Qxx 05Cxx 90Cxx PDFBibTeX XMLCite \textit{L. Jaffke} and \textit{B. M. P. Jansen}, Discrete Appl. Math. 327, 33--46 (2023; Zbl 07640726) Full Text: DOI
Lozin, Vadim Hereditary classes of graphs: a parametric approach. (English) Zbl 1504.05241 Discrete Appl. Math. 325, 134-151 (2023). MSC: 05C75 05D10 PDFBibTeX XMLCite \textit{V. Lozin}, Discrete Appl. Math. 325, 134--151 (2023; Zbl 1504.05241) Full Text: DOI
Alecu, Bogdan; Lozin, Vadim; de Werra, Dominique The micro-world of cographs. (English) Zbl 1485.05154 Discrete Appl. Math. 312, 3-14 (2022). MSC: 05C75 05C99 06A06 PDFBibTeX XMLCite \textit{B. Alecu} et al., Discrete Appl. Math. 312, 3--14 (2022; Zbl 1485.05154) Full Text: DOI
Bonamy, Marthe; Bousquet, Nicolas; Pilipczuk, Michał; Rzążewski, Paweł; Thomassé, Stéphan; Walczak, Bartosz Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs. (English) Zbl 1478.05047 J. Comb. Theory, Ser. B 152, 353-378 (2022). MSC: 05C15 05C75 05C35 05C60 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 152, 353--378 (2022; Zbl 1478.05047) Full Text: DOI arXiv
Bok, Jan; Jedličková, Nikola; Martin, Barnaby; Paulusma, Daniël; Smith, Siani 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 \textit{J. Bok} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 22, 22 p. (2020; Zbl 07651161) Full Text: DOI arXiv
Alecu, Bogdan; Lozin, Vadim; de Werra, Dominique The micro-world of cographs. (English) Zbl 07600996 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 30-42 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{B. Alecu} et al., Lect. Notes Comput. Sci. 12126, 30--42 (2020; Zbl 07600996) Full Text: DOI
Alecu, Bogdan; Kanté, Mamadou Moustapha; Lozin, Vadim; Zamaraev, Viktor Between clique-width and linear clique-width of bipartite graphs. (English) Zbl 1441.05112 Discrete Math. 343, No. 8, Article ID 111926, 13 p. (2020). MSC: 05C30 05C78 05C75 PDFBibTeX XMLCite \textit{B. Alecu} et al., Discrete Math. 343, No. 8, Article ID 111926, 13 p. (2020; Zbl 1441.05112) Full Text: DOI Link
Choi, Ilkyoo; Furuya, Michitaka; Kim, Ringi; Park, Boram A Ramsey-type theorem for the matching number regarding connected graphs. (English) Zbl 1429.05137 Discrete Math. 343, No. 2, Article ID 111648, 6 p. (2020). MSC: 05C55 05D10 05C40 05C70 PDFBibTeX XMLCite \textit{I. Choi} et al., Discrete Math. 343, No. 2, Article ID 111648, 6 p. (2020; Zbl 1429.05137) Full Text: DOI arXiv
Gaspers, Serge; Huang, Shenwei; Paulusma, Daniël Colouring square-free graphs without long induced paths. (English) Zbl 1429.68081 J. Comput. Syst. Sci. 106, 60-79 (2019). MSC: 68Q25 05C15 68Q17 PDFBibTeX XMLCite \textit{S. Gaspers} et al., J. Comput. Syst. Sci. 106, 60--79 (2019; Zbl 1429.68081) Full Text: DOI arXiv Link
Kamiński, Marcin; Pstrucha, Anna Certifying coloring algorithms for graphs without long induced paths. (English) Zbl 1410.05204 Discrete Appl. Math. 261, 258-267 (2019). MSC: 05C85 05C15 PDFBibTeX XMLCite \textit{M. Kamiński} and \textit{A. Pstrucha}, Discrete Appl. Math. 261, 258--267 (2019; Zbl 1410.05204) Full Text: DOI arXiv
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony Finding cactus roots in polynomial time. (English) Zbl 1391.68052 Theory Comput. Syst. 62, No. 6, 1409-1426 (2018). MSC: 68Q25 05C76 68R10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theory Comput. Syst. 62, No. 6, 1409--1426 (2018; Zbl 1391.68052) Full Text: DOI
Esperet, Louis; Lemoine, Laetitia; Maffray, Frédéric Long induced paths in graphs. (English) Zbl 1358.05148 Eur. J. Comb. 62, 1-14 (2017). MSC: 05C38 05C40 05C10 PDFBibTeX XMLCite \textit{L. Esperet} et al., Eur. J. Comb. 62, 1--14 (2017; Zbl 1358.05148) Full Text: DOI arXiv
Lozin, V. V.; Malyshev, D. S. Vertex coloring of graphs with few obstructions. (English) Zbl 1350.05038 Discrete Appl. Math. 216, Part 1, 273-280 (2017). MSC: 05C15 05C85 68W25 68Q25 PDFBibTeX XMLCite \textit{V. V. Lozin} and \textit{D. S. Malyshev}, Discrete Appl. Math. 216, Part 1, 273--280 (2017; Zbl 1350.05038) Full Text: DOI
Hell, Pavol; Huang, Shenwei Complexity of coloring graphs without paths and cycles. (English) Zbl 1350.05037 Discrete Appl. Math. 216, Part 1, 211-232 (2017). MSC: 05C15 05C38 68Q17 PDFBibTeX XMLCite \textit{P. Hell} and \textit{S. Huang}, Discrete Appl. Math. 216, Part 1, 211--232 (2017; Zbl 1350.05037) Full Text: DOI
Di Giacomo, Emilio; Liotta, Giuseppe; Mchedlidze, Tamara Lower and upper bounds for long induced paths in 3-connected planar graphs. (English) Zbl 1342.05071 Theor. Comput. Sci. 636, 47-55 (2016). MSC: 05C38 05C10 05C40 05C60 PDFBibTeX XMLCite \textit{E. Di Giacomo} et al., Theor. Comput. Sci. 636, 47--55 (2016; Zbl 1342.05071) Full Text: DOI
Atminas, Aistis; Lozin, Vadim V. Labelled induced subgraphs and well-quasi-ordering. (English) Zbl 1325.05141 Order 32, No. 3, 313-328 (2015). MSC: 05C78 PDFBibTeX XMLCite \textit{A. Atminas} and \textit{V. V. Lozin}, Order 32, No. 3, 313--328 (2015; Zbl 1325.05141) Full Text: DOI
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