Jakub Kwasny

According to our database, Jakub Kwasny authored at least 7 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Breaking small automorphisms by list colourings.

Jakub Kwasny, Marcin Stawiski

J. Graph Theory, February, 2025

2024

List proper connection of 2-edge-connected graphs.

Jakub Kwasny, Marcin Stawiski

Australas. J Comb., October, 2024

Inclusion chromatic index of random graphs.

Jakub Kwasny, Jakub Przybylo

J. Graph Theory, 2024

Small dense on-line arbitrarily partitionable graphs.

Monika Bednarz, Agnieszka Burkot, Jakub Kwasny, Kamil Pawlowski, Angelika Ryngier

Appl. Math. Comput., 2024

2021

On the inclusion chromatic index of a graph.

Jakub Przybylo, Jakub Kwasny

J. Graph Theory, 2021

Inclusion total chromatic number.

Jakub Kwasny

Discret. Math., 2021

2019

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

Jakub Kwasny, Jakub Przybylo

Random Struct. Algorithms, 2019