Jakub Przybylo

Discret. Math., 2026

Alon-Tarsi for hypergraphs.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

,

CoRR, January, 2025

The irregularity strength of dense graphs - on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Degree-balanced decompositions of cubic graphs.

[BibT_eX]

[DOI]

Borut Luzar

,

,

Roman Soták

Eur. J. Comb., 2025

Mrs. Correct and majority colorings.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2025

On List Extensions of the Majority Edge Colourings.

[BibT_eX]

[DOI]

Pawel Pekala

,

Electron. J. Comb., 2025

A note on the conflict-free chromatic index.

[BibT_eX]

[DOI]

Mateusz Kamyczura

,

Mariusz Meszka

,

Discret. Math., April, 2024

On triangle-free list assignments.

[BibT_eX]

[DOI]

Discret. Math., February, 2024

On conflict-free proper colourings of graphs without small degree vertices.

[BibT_eX]

[DOI]

Mateusz Kamyczura

,

Discret. Math., January, 2024

Inclusion chromatic index of random graphs.

[BibT_eX]

[DOI]

Jakub Kwasny

,

J. Graph Theory, 2024

Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

On Generalised Majority Edge-Colourings of Graphs.

[BibT_eX]

[DOI]

Pawel Pekala

,

Electron. J. Comb., 2024

Decomposability of regular graphs to 4 locally irregular subgraphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

A note on decomposing graphs to locally almost irregular subgraphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

On the Asymptotic Confirmation of the Faudree-Lehel Conjecture for General Graphs.

[BibT_eX]

[DOI]

,

Fan Wei

Comb., August, 2023

Short Proof of the Asymptotic Confirmation of the Faudree-Lehel Conjecture.

[BibT_eX]

[DOI]

,

Fan Wei

Electron. J. Comb., 2023

The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree.

[BibT_eX]

[DOI]

Comb., December, 2022

A generalization of Faudree-Lehel conjecture holds almost surely for random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Conflict-free chromatic number versus conflict-free chromatic index.

[BibT_eX]

[DOI]

Michal Debski

,

J. Graph Theory, 2022

On the inclusion chromatic index of a graph.

[BibT_eX]

[DOI]

,

Jakub Kwasny

J. Graph Theory, 2021

The 1-2-3 Conjecture almost holds for regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

On the Standard (2, 2)-Conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Largest Component and Node Fault Tolerance for Grids.

[BibT_eX]

[DOI]

,

Andrzej Zak

Electron. J. Comb., 2021

On the total neighbour sum distinguishing index of graphs with bounded maximum average degree.

[BibT_eX]

[DOI]

Hervé Hocquard

,

J. Comb. Optim., 2020

On a total version of 1-2-3 Conjecture.

[BibT_eX]

[DOI]

,

,

,

,

,

Discuss. Math. Graph Theory, 2020

Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number.

[BibT_eX]

[DOI]

Jakub Kwasny

,

Random Struct. Algorithms, 2019

A note on asymptotically optimal neighbour sum distinguishing colourings.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

Discret. Math. Theor. Comput. Sci., 2019

Distant total sum distinguishing index of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

A note on the weak (2, 2)-Conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2019

Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Julien Bensmail

,

Discret. Appl. Math., 2019

Distant sum distinguishing index of graphs with bounded minimum degree.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2019

Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs.

[BibT_eX]

[DOI]

Marcin Anholcer

,

,

Appl. Math. Comput., 2019

New bounds for locally irregular chromatic index of bipartite and subcubic graphs.

[BibT_eX]

[DOI]

Borut Luzar

,

,

Roman Soták

J. Comb. Optim., 2018

Distant set distinguishing edge colourings of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Group twin coloring of graphs.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2018

On locally irregular decompositions and the 1-2 Conjecture in digraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Theor. Comput. Sci., 2018

Distant total irregularity strength of graphs via random vertex ordering.

[BibT_eX]

[DOI]

Discret. Math., 2018

A note on a directed version of the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Mirko Hornák

,

,

Discret. Appl. Math., 2018

On the Neighbor Sum Distinguishing Index of Planar Graphs.

[BibT_eX]

[DOI]

Marthe Bonamy

,

J. Graph Theory, 2017

On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree.

[BibT_eX]

[DOI]

Hervé Hocquard

,

Graphs Comb., 2017

Distant sum distinguishing index of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

Asymptotically optimal neighbor sum distinguishing total colorings of graphs.

[BibT_eX]

[DOI]

Sarah Loeb

,

,

Yunfang Tang

Discret. Math., 2017

The neighbour-sum-distinguishing edge-colouring game.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2017

On weight choosabilities of graphs with bounded maximum average degree.

[BibT_eX]

[DOI]

,

André Raspaud

,

Discret. Appl. Math., 2017

Distant irregularity strength of graphs with bounded minimum degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Equitable neighbour-sum-distinguishing edge and total colourings.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Appl. Math., 2017

On a directed variation of the 1-2-3 and 1-2 Conjectures.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2017

On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method.

[BibT_eX]

[DOI]

,

Jens Schreyer

,

Erika Skrabul'áková

Graphs Comb., 2016

On an extremal problem in the class of bipartite 1-planar graphs.

[BibT_eX]

[DOI]

Július Czap

,

,

Erika Skrabul'áková

Discuss. Math. Graph Theory, 2016

Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

A note on adjacent vertex distinguishing colorings of graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Appl. Math., 2016

Distant Set Distinguishing Total Colourings of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

On Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Asymptotically optimal neighbour sum distinguishing colourings of graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited.

[BibT_eX]

[DOI]

,

Tsai-Lien Wong

J. Graph Theory, 2015

On decomposing regular graphs into locally irregular subgraphs.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2015

Partitioning powers of traceable or hamiltonian graphs.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2014

On the Irregularity Strength of Dense Graphs.

[BibT_eX]

[DOI]

Piotr Majerski

,

SIAM J. Discret. Math., 2014

On the Facial Thue Choice Index via Entropy Compression.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Total Vertex Irregularity Strength of Dense Graphs.

[BibT_eX]

[DOI]

Piotr Majerski

,

J. Graph Theory, 2014

On colour-blind distinguishing colour pallets in regular graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

How to personalize the vertices of a graph?

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2014

On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math. Theor. Comput. Sci., 2014

On the structure of arbitrarily partitionable graphs with given connectivity.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2014

On the neighbour sum distinguishing index of planar graphs.

[BibT_eX]

[DOI]

Marthe Bonamy

,

CoRR, 2014

Colour-blind Can Distinguish Colour Pallets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Neighbor Sum Distinguishing Index.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2013

Rainbow connection in sparse graphs.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2013

Distant irregularity strength of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

On upper bounds for multiple domination numbers of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Can Colour-Blind Distinguish Colour Palettes?

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2013

On minimal arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

Olivier Baudon

,

,

Inf. Process. Lett., 2012

Seifert graphs and the braid index of classical and singular links.

[BibT_eX]

[DOI]

Leonid Plachta

,

,

Discret. Math., 2012

Nonrepetitive list colourings of paths.

[BibT_eX]

[DOI]

Jaroslaw Grytczuk

,

,

Xuding Zhu

Random Struct. Algorithms, 2011

Irregular edge coloring of 2-regular graphs.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2011

Total Weight Choosability of Graphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2011

On a 1, 2 Conjecture.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2010

Vertex-distinquishing edge-colorings of linear forests.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2010

Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Decompositions of pseudographs into closed trails of even sizes.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2009

A new upper bound for the total vertex irregularity strength of graphs.

[BibT_eX]

[DOI]

Marcin Anholcer

,

Maciej Kalkowski

,

Discret. Math., 2009

A Note on Neighbour-Distinguishing Regular Graphs Total-Weighting.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Irregularity Strength of Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Irregular edge-colorings of sums of cycles of even lengths.

[BibT_eX]

[DOI]

,

,