Monika Pilsniak

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 33

Top Topics

Series Parallel

Efficiently Computable

Cartesian Product

Top Venues

Ars Math. Contemp.

Electron. J. Comb.

Discuss. Math. Graph Theory

Publications

Igor Grzelec, Monika Pilsniak, Mariusz Wozniak
A note on uniquely embeddable 2-factors. Appl. Math. Comput. 468 (2024)
Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz
Total and paired domination stability in prisms. Discuss. Math. Graph Theory 43 (4) (2023)
Felix Bock, Rafal Kalinowski, Johannes Pardey, Monika Pilsniak, Dieter Rautenbach, Mariusz Wozniak
Majority Edge-Colorings of Graphs. Electron. J. Comb. 30 (1) (2023)
Florian Lehner, Monika Pilsniak, Marcin Stawiski
Distinguishing infinite graphs with bounded degrees. J. Graph Theory 101 (1) (2022)
Florian Lehner, Monika Pilsniak, Marcin Stawiski
Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145]. Eur. J. Comb. 101 (2022)
Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz
Paired domination stability in graphs. Ars Math. Contemp. 22 (2) (2022)
Rafal Kalinowski, Monika Pilsniak
Extremal graphs for the distinguishing index. Discret. Math. 345 (8) (2022)
Rafal Kalinowski, Monika Pilsniak
Proper distinguishing arc-colourings of symmetric digraphs. Appl. Math. Comput. 421 (2022)
Aleksandra Gorzkowska, Michael A. Henning, Elzbieta Kleszcz, Monika Pilsniak
Paired Domination in Trees. Graphs Comb. 38 (4) (2022)
Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz
Bounds on the paired domination number of graphs with minimum degree at least three. Appl. Math. Comput. 417 (2022)
Rafal Kalinowski, Monika Pilsniak, Magdalena Prorok
Distinguishing arc-colourings of symmetric digraphs. Art Discret. Appl. Math. 6 (2) (2022)
Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak
On Asymmetric Colourings of Claw-Free Graphs. Electron. J. Comb. 28 (3) (2021)
Monika Pilsniak
Nordhaus-Gaddum type inequalities for the distinguishing index. Ars Math. Contemp. 20 (2) (2021)
Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40 (4) (2020)
Monika Pilsniak, Thomas W. Tucker
Distinguishing index of maps. Eur. J. Comb. 84 (2020)
Monika Pilsniak, Marcin Stawiski
The optimal general upper bound for the distinguishing index of infinite graphs. J. Graph Theory 93 (4) (2020)
Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak
The distinguishing index of connected graphs without pendant edges. Ars Math. Contemp. 18 (1) (2020)
Florian Lehner, Monika Pilsniak, Marcin Stawiski
A bound for the distinguishing index of regular graphs. Eur. J. Comb. 89 (2020)
Izak Broere, Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak
Asymmetric colorings of products of graphs and digraphs. Discret. Appl. Math. 266 (2019)
Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. 222 (2017)
Monika Pilsniak
Edge motion and the distinguishing index. Theor. Comput. Sci. 678 (2017)
Aleksandra Gorzkowska, Rafal Kalinowski, Monika Pilsniak
The distinguishing index of the Cartesian product of finite graphs. Ars Math. Contemp. 12 (1) (2017)
Monika Pilsniak
Improving upper bounds for the distinguishing index. Ars Math. Contemp. 13 (2) (2017)
Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37 (1) (2017)
Izak Broere, Monika Pilsniak
The distinguishing index of the Cartesian product of countable graphs. Ars Math. Contemp. 13 (1) (2017)
Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
Equitable neighbour-sum-distinguishing edge and total colourings. CoRR (2017)
Ehsan Estaji, Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Thomas W. Tucker
Distinguishing Cartesian products of countable graphs. Discuss. Math. Graph Theory 37 (1) (2017)
Aleksandra Gorzkowska, Monika Pilsniak
Precise bounds for the distinguishing index of the Cartesian product. Theor. Comput. Sci. 687 (2017)
Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak
A note on breaking small automorphisms in graphs. Discret. Appl. Math. 232 (2017)
Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mohammad Hadi Shekarriz
Bounds for Distinguishing Invariants of Infinite Graphs. Electron. J. Comb. 24 (3) (2017)
Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak
Distinguishing graphs by total colourings. Ars Math. Contemp. 11 (1) (2016)
Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak
Preface. Discret. Math. 339 (7) (2016)
Rafal Kalinowski, Monika Pilsniak, Ingo Schiermeyer, Mariusz Wozniak
Dense arbitrarily partitionable graphs. Discuss. Math. Graph Theory 36 (1) (2016)
Monika Pilsniak, Mariusz Wozniak
On the Total-Neighbor-Distinguishing Index by Sums. Graphs Comb. 31 (3) (2015)
Rafal Kalinowski, Monika Pilsniak
Distinguishing graphs by edge-colourings. Eur. J. Comb. 45 (2015)
Izak Broere, Monika Pilsniak
The Distinguishing Index of Infinite Graphs. Electron. J. Comb. 22 (1) (2015)
Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
How to personalize the vertices of a graph? Eur. J. Comb. 40 (2014)
Wilfried Imrich, Rafal Kalinowski, Florian Lehner, Monika Pilsniak
Endomorphism Breaking in Graphs. Electron. J. Comb. 21 (1) (2014)
Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
Can Colour-Blind Distinguish Colour Palettes? Electron. J. Comb. 20 (3) (2013)
Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak
Preface. Discret. Math. 312 (14) (2012)
Mieczyslaw Borowiecki, Jaroslaw Grytczuk, Monika Pilsniak
Coloring chip configurations on graphs and digraphs. Inf. Process. Lett. 112 (1-2) (2012)
Monika Pilsniak, Mariusz Wozniak
On packing of two copies of a hypergraph. Discret. Math. Theor. Comput. Sci. 13 (3) (2011)
Agnieszka Görlich, Monika Pilsniak
A note on an embedding problem in transitive tournaments. Discret. Math. 310 (4) (2010)
Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo
Arbitrarily vertex decomposable suns with few rays. Discret. Math. 309 (11) (2009)
Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo
On-line arbitrarily vertex decomposable suns. Discret. Math. 309 (22) (2009)
Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak
A note on decompositions of transitive tournaments. Discret. Math. 307 (7-8) (2007)
Monika Pilsniak
Packing of two digraphs into a transitive tournament. Discret. Math. 307 (7-8) (2007)
Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak
A note on decompositions of transitive tournaments II. Australas. J Comb. 37 (2007)
Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo
Fixed-point-free embeddings of digraphs with small size. Discret. Math. 307 (11-12) (2007)
Monika Pilsniak, Mariusz Wozniak
A note on packing of two copies of a hypergraph. Discuss. Math. Graph Theory 27 (1) (2007)
Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak
A Note on a Packing Problem in Transitive Tournaments. Graphs Comb. 22 (2) (2006)
Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo
Some families of arbitrarily vertex decomposable graphs. Electron. Notes Discret. Math. 22 (2005)
Monika Pilsniak
Packing of three copies of a digraph into the transitive tournament. Discuss. Math. Graph Theory 24 (3) (2004)
Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo
A note on embedding graphs without short cycles. Discret. Math. 286 (1-2) (2004)
Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak
On cyclically embeddable (n, n)-graphs. Discuss. Math. Graph Theory 23 (1) (2003)