Jakub Przybylo

93 papers B 1Journal 92

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs. Discret. Math. Mateusz Kamyczura, Jakub Przybylo
2025	J	`jnl`	Alon-Tarsi for hypergraphs. CoRR Marcin Anholcer, Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo, Oriol Serra, Michal Tuczynski, Lluís Vena, Mariusz Zajac
2025	J	`jnl`	Degree-balanced decompositions of cubic graphs. Eur. J. Comb. Borut Luzar, Jakub Przybylo, Roman Soták
2025	J	`jnl`	Mrs. Correct and majority colorings. Discret. Math. Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk, Grzegorz Gutowski, Jakub Przybylo, Mariusz Zajac
2025	J	`jnl`	On List Extensions of the Majority Edge Colourings. Electron. J. Comb. Pawel Pekala, Jakub Przybylo
2025	J	`jnl`	The irregularity strength of dense graphs - on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel. Eur. J. Comb. Jakub Przybylo
2024	J	`jnl`	A note on decomposing graphs to locally almost irregular subgraphs. Appl. Math. Comput. Jakub Przybylo
2024	J	`jnl`	A note on the conflict-free chromatic index. Discret. Math. Mateusz Kamyczura, Mariusz Meszka, Jakub Przybylo
2024	J	`jnl`	Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment. Eur. J. Comb. Jakub Przybylo
2024	J	`jnl`	Decomposability of regular graphs to 4 locally irregular subgraphs. Appl. Math. Comput. Jakub Przybylo
2024	J	`jnl`	Degree-balanced decompositions of cubic graphs. CoRR Borut Luzar, Jakub Przybylo, Roman Soták
2024	B	`conf`	First-Fit Coloring of Forests in Random Arrival Model. MFCS Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo
2024	J	`jnl`	First-Fit Coloring of Forests in Random Arrival Model. CoRR Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo
2024	J	`jnl`	Inclusion chromatic index of random graphs. J. Graph Theory Jakub Kwasny, Jakub Przybylo
2024	J	`jnl`	On Generalised Majority Edge-Colourings of Graphs. Electron. J. Comb. Pawel Pekala, Jakub Przybylo
2024	J	`jnl`	On conflict-free proper colourings of graphs without small degree vertices. Discret. Math. Mateusz Kamyczura, Jakub Przybylo
2024	J	`jnl`	On triangle-free list assignments. Discret. Math. Jakub Przybylo
2023	J	`jnl`	On the Asymptotic Confirmation of the Faudree-Lehel Conjecture for General Graphs. Comb. Jakub Przybylo, Fan Wei
2023	J	`jnl`	Short Proof of the Asymptotic Confirmation of the Faudree-Lehel Conjecture. Electron. J. Comb. Jakub Przybylo, Fan Wei
2022	J	`jnl`	A generalization of Faudree-Lehel conjecture holds almost surely for random graphs. Random Struct. Algorithms Jakub Przybylo
2022	J	`jnl`	Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees. J. Graph Theory Jakub Przybylo
2022	J	`jnl`	Conflict-free chromatic number versus conflict-free chromatic index. J. Graph Theory Michal Debski, Jakub Przybylo
2022	J	`jnl`	The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree. Comb. Jakub Przybylo
2021	J	`jnl`	Largest Component and Node Fault Tolerance for Grids. Electron. J. Comb. Jakub Przybylo, Andrzej Zak
2021	J	`jnl`	On the Standard (2, 2)-Conjecture. Eur. J. Comb. Jakub Przybylo
2021	J	`jnl`	On the inclusion chromatic index of a graph. J. Graph Theory Jakub Przybylo, Jakub Kwasny
2021	J	`jnl`	The 1-2-3 Conjecture almost holds for regular graphs. J. Comb. Theory B Jakub Przybylo
2020	J	`jnl`	On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
2020	J	`jnl`	On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. J. Comb. Optim. Hervé Hocquard, Jakub Przybylo
2019	J	`jnl`	A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2019	J	`jnl`	A note on asymptotically optimal neighbour sum distinguishing colourings. Eur. J. Comb. Jakub Przybylo
2019	J	`jnl`	A note on the weak (2, 2)-Conjecture. Discret. Math. Jakub Przybylo
2019	J	`jnl`	Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number. Random Struct. Algorithms Jakub Kwasny, Jakub Przybylo
2019	J	`jnl`	Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. Discret. Appl. Math. Julien Bensmail, Jakub Przybylo
2019	J	`jnl`	Distant sum distinguishing index of graphs with bounded minimum degree. Ars Math. Contemp. Jakub Przybylo
2019	J	`jnl`	Distant total sum distinguishing index of graphs. Discret. Math. Jakub Przybylo
2019	J	`jnl`	Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs. Appl. Math. Comput. Marcin Anholcer, Sylwia Cichacz, Jakub Przybylo
2019	J	`jnl`	On the Standard (2, 2)-Conjecture. CoRR Jakub Przybylo
2018	J	`jnl`	A note on a directed version of the 1-2-3 Conjecture. Discret. Appl. Math. Mirko Hornák, Jakub Przybylo, Mariusz Wozniak
2018	J	`jnl`	Distant set distinguishing edge colourings of graphs. Eur. J. Comb. Jakub Przybylo
2018	J	`jnl`	Distant total irregularity strength of graphs via random vertex ordering. Discret. Math. Jakub Przybylo
2018	J	`jnl`	Group twin coloring of graphs. Discret. Math. Theor. Comput. Sci. Sylwia Cichacz, Jakub Przybylo
2018	J	`jnl`	New bounds for locally irregular chromatic index of bipartite and subcubic graphs. J. Comb. Optim. Borut Luzar, Jakub Przybylo, Roman Soták
2018	J	`jnl`	On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2017	J	`jnl`	Asymptotically optimal neighbor sum distinguishing total colorings of graphs. Discret. Math. Sarah Loeb, Jakub Przybylo, Yunfang Tang
2017	J	`jnl`	Distant irregularity strength of graphs with bounded minimum degree. Discret. Appl. Math. Jakub Przybylo
2017	J	`jnl`	Distant sum distinguishing index of graphs. Discret. Math. Jakub Przybylo
2017	J	`jnl`	Equitable neighbour-sum-distinguishing edge and total colourings. CoRR Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2017	J	`jnl`	Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2017	J	`jnl`	On a directed variation of the 1-2-3 and 1-2 Conjectures. Discret. Appl. Math. Emma Barme, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2017	J	`jnl`	On the Neighbor Sum Distinguishing Index of Planar Graphs. J. Graph Theory Marthe Bonamy, Jakub Przybylo
2017	J	`jnl`	On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree. Graphs Comb. Hervé Hocquard, Jakub Przybylo
2017	J	`jnl`	On weight choosabilities of graphs with bounded maximum average degree. Discret. Appl. Math. Jakub Przybylo, André Raspaud, Mariusz Wozniak
2017	J	`jnl`	The neighbour-sum-distinguishing edge-colouring game. Discret. Math. Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak
2016	J	`jnl`	A note on adjacent vertex distinguishing colorings of graphs. Discret. Appl. Math. Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták, Margit Voigt, Jenny Weidelich
2016	J	`jnl`	Distant Set Distinguishing Total Colourings of Graphs. Electron. J. Comb. Jakub Przybylo
2016	J	`jnl`	Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz. Discret. Appl. Math. Jakub Przybylo
2016	J	`jnl`	On Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs. Electron. J. Comb. Jakub Przybylo
2016	J	`jnl`	On an extremal problem in the class of bipartite 1-planar graphs. Discuss. Math. Graph Theory Július Czap, Jakub Przybylo, Erika Skrabul'áková
2016	J	`jnl`	On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method. Graphs Comb. Jakub Przybylo, Jens Schreyer, Erika Skrabul'áková
2015	J	`jnl`	Asymptotically optimal neighbour sum distinguishing colourings of graphs. Random Struct. Algorithms Jakub Przybylo
2015	J	`jnl`	Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited. J. Graph Theory Jakub Przybylo, Tsai-Lien Wong
2015	J	`jnl`	On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2014	J	`jnl`	Colour-blind Can Distinguish Colour Pallets. Electron. J. Comb. Jakub Przybylo
2014	J	`jnl`	How to personalize the vertices of a graph? Eur. J. Comb. Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
2014	J	`jnl`	On colour-blind distinguishing colour pallets in regular graphs. J. Comb. Optim. Jakub Przybylo
2014	J	`jnl`	On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak
2014	J	`jnl`	On the Facial Thue Choice Index via Entropy Compression. J. Graph Theory Jakub Przybylo
2014	J	`jnl`	On the Irregularity Strength of Dense Graphs. SIAM J. Discret. Math. Piotr Majerski, Jakub Przybylo
2014	J	`jnl`	On the neighbour sum distinguishing index of planar graphs. CoRR Marthe Bonamy, Jakub Przybylo
2014	J	`jnl`	On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak
2014	J	`jnl`	Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2014	J	`jnl`	Total Vertex Irregularity Strength of Dense Graphs. J. Graph Theory Piotr Majerski, Jakub Przybylo
2013	J	`jnl`	Can Colour-Blind Distinguish Colour Palettes? Electron. J. Comb. Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
2013	J	`jnl`	Distant irregularity strength of graphs. Discret. Math. Jakub Przybylo
2013	J	`jnl`	Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz. SIAM J. Discret. Math. Jakub Przybylo
2013	J	`jnl`	Neighbor Sum Distinguishing Index. Graphs Comb. Evelyne Flandrin, Antoni Marczyk, Jakub Przybylo, Jean-François Saclé, Mariusz Wozniak
2013	J	`jnl`	On upper bounds for multiple domination numbers of graphs. Discret. Appl. Math. Jakub Przybylo
2013	J	`jnl`	Rainbow connection in sparse graphs. Discuss. Math. Graph Theory Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak
2012	J	`jnl`	On minimal arbitrarily partitionable graphs. Inf. Process. Lett. Olivier Baudon, Jakub Przybylo, Mariusz Wozniak
2012	J	`jnl`	Seifert graphs and the braid index of classical and singular links. Discret. Math. Leonid Plachta, Jakub Przybylo, Mariusz Wozniak
2011	J	`jnl`	Irregular edge coloring of 2-regular graphs. Discret. Math. Theor. Comput. Sci. Sylwia Cichacz, Jakub Przybylo
2011	J	`jnl`	Nonrepetitive list colourings of paths. Random Struct. Algorithms Jaroslaw Grytczuk, Jakub Przybylo, Xuding Zhu
2011	J	`jnl`	Total Weight Choosability of Graphs. Electron. J. Comb. Jakub Przybylo, Mariusz Wozniak
2010	J	`jnl`	On a 1, 2 Conjecture. Discret. Math. Theor. Comput. Sci. Jakub Przybylo, Mariusz Wozniak
2010	J	`jnl`	Vertex-distinquishing edge-colorings of linear forests. Discuss. Math. Graph Theory Sylwia Cichacz, Jakub Przybylo
2009	J	`jnl`	A new upper bound for the total vertex irregularity strength of graphs. Discret. Math. Marcin Anholcer, Maciej Kalkowski, Jakub Przybylo
2009	J	`jnl`	Decompositions of pseudographs into closed trails of even sizes. Discret. Math. Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak
2009	J	`jnl`	Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs. SIAM J. Discret. Math. Jakub Przybylo
2008	J	`jnl`	A Note on Neighbour-Distinguishing Regular Graphs Total-Weighting. Electron. J. Comb. Jakub Przybylo
2008	J	`jnl`	Irregular edge-colorings of sums of cycles of even lengths. Australas. J Comb. Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak
2008	J	`jnl`	Irregularity Strength of Regular Graphs. Electron. J. Comb. Jakub Przybylo
2006	J	`jnl`	Arbitrarily vertex decomposable caterpillars with four or five leaves. Discuss. Math. Graph Theory Sylwia Cichacz, Agnieszka Görlich, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak