Powrót do listy instytutów
Publikacje
Czasopismo: Electronic Journal of Combinatorics
Liczba publikacji: 122024
- Shuo Li, Jakub Pachocki, Jakub Radoszewski , A Note on the Maximum Number of k-Powers in a Finite Word, Electronic Journal of Combinatorics, 31 (3) 2024, s. 1-10. Zobacz w PBN
2023
- Jesper Nederlof, Michał Pilipczuk , Karol Węgrzycki, Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models, Electronic Journal of Combinatorics, 30 (3) 2023. Zobacz w PBN
- Linda Cook, Tomáš Masařík , Marcin Pilipczuk , Amadeus Reinald, Uéverton Dos Santos Souza, Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$, Electronic Journal of Combinatorics, 30 (3) 2023, s. 1-27. Zobacz w PBN
- Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter , Tomasz Waleń , Tight bound for the number of distinct palindromes in a tree, Electronic Journal of Combinatorics, 30 (2) 2023, s. 1-18. Zobacz w PBN
2022
- Wojciech Nadara , Marcin Smulewicz, Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph, Electronic Journal of Combinatorics, 29 (1) 2022. Zobacz w PBN
- Sean English, Tomáš Masařík , Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro, Linear Bounds for Cycle-Free Saturation Games, Electronic Journal of Combinatorics, 29 (3) 2022, s. 5:1-5:21. Zobacz w PBN
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. Zobacz w 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, s. P4.5: 1-12. Zobacz w 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, s. P4.17. Zobacz w PBN
2018
- Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk , Excluding Hooks and their Complements, Electronic Journal of Combinatorics, 25 (3) 2018, s. P3.27:1 - P3.27: 33. Zobacz w PBN
2016
- Michał Pilipczuk , Szymon Toruńczyk , On Ultralimits of Sparse Graph Classes, Electronic Journal of Combinatorics, 23 (2) 2016, s. P2.32. Zobacz w PBN
2013
- Paweł Baturo, Marcin Piątkowski, Wojciech Rytter , The maximal number of runs in standard Sturmian words., Electronic Journal of Combinatorics, 20 (1) 2013, s. P13-1-21. Zobacz w PBN