Publications

Journal: Electronic Journal of Combinatorics

2021

• Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk , Michał Pilipczuk , Covering minimal separators andpotential maximal cliques in $P_{t}$-free graphs, Electronic Journal of Combinatorics, 28 (1) 2021. See in PBN
• Marthe Bonamy, François Dross, Tomáš Masařík , Andrea Munaro, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Jones' Conjecture in Subcubic Graphs, Electronic Journal of Combinatorics, 28 (4) 2021, p. P4.5: 1-12. See in PBN

2020

• Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk , Xuding Zhu, Clustering Powers of Sparse Graphs, Electronic Journal of Combinatorics, 27 (4) 2020, p. P4.17. See in PBN

2018

• Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk , Excluding Hooks and their Complements, Electronic Journal of Combinatorics, 25 (3) 2018, p. P3.27:1 - P3.27: 33. See in PBN

2016

• Michał Pilipczuk , Szymon Toruńczyk , On Ultralimits of Sparse Graph Classes, Electronic Journal of Combinatorics, 23 (2) 2016, p. P2.32. See in PBN

2013

• Paweł Baturo, Marcin Piątkowski, Wojciech Rytter , The Maximal Number of Runs in Standard Sturmian Words, Electronic Journal of Combinatorics, 2013. See in PBN