Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Monika Pilsniak
@article{DBLP:journals/amc/GrzelecPW24,
author = {Igor Grzelec and
Monika Pilsniak and
Mariusz Wozniak},
title = {A note on uniquely embeddable 2-factors},
journal = {Appl. Math. Comput.},
volume = {468},
pages = {128505},
year = {2024},
url = {https://doi.org/10.1016/j.amc.2023.128505},
doi = {10.1016/J.AMC.2023.128505},
timestamp = {Sat, 10 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/GrzelecPW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BockKPPRW23,
author = {Felix Bock and
Rafal Kalinowski and
Johannes Pardey and
Monika Pilsniak and
Dieter Rautenbach and
Mariusz Wozniak},
title = {Majority Edge-Colorings of Graphs},
journal = {Electron. J. Comb.},
volume = {30},
number = {1},
year = {2023},
url = {https://doi.org/10.37236/11291},
doi = {10.37236/11291},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BockKPPRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/GorzkowskaHPT23,
author = {Aleksandra Gorzkowska and
Michael A. Henning and
Monika Pilsniak and
Elzbieta Tumidajewicz},
title = {Total and paired domination stability in prisms},
journal = {Discuss. Math. Graph Theory},
volume = {43},
number = {4},
pages = {1147--1169},
year = {2023},
url = {https://doi.org/10.7151/dmgt.2421},
doi = {10.7151/DMGT.2421},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/GorzkowskaHPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adam/KalinowskiPP22,
author = {Rafal Kalinowski and
Monika Pilsniak and
Magdalena Prorok},
title = {Distinguishing arc-colourings of symmetric digraphs},
journal = {Art Discret. Appl. Math.},
volume = {6},
number = {2},
pages = {2},
year = {2022},
url = {https://doi.org/10.26493/2590-9770.1472.24b},
doi = {10.26493/2590-9770.1472.24B},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/adam/KalinowskiPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/HenningPT22,
author = {Michael A. Henning and
Monika Pilsniak and
Elzbieta Tumidajewicz},
title = {Bounds on the paired domination number of graphs with minimum degree
at least three},
journal = {Appl. Math. Comput.},
volume = {417},
pages = {126782},
year = {2022},
url = {https://doi.org/10.1016/j.amc.2021.126782},
doi = {10.1016/J.AMC.2021.126782},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amc/HenningPT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/KalinowskiP22,
author = {Rafal Kalinowski and
Monika Pilsniak},
title = {Proper distinguishing arc-colourings of symmetric digraphs},
journal = {Appl. Math. Comput.},
volume = {421},
pages = {126939},
year = {2022},
url = {https://doi.org/10.1016/j.amc.2022.126939},
doi = {10.1016/J.AMC.2022.126939},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amc/KalinowskiP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/GorzkowskaHPT22,
author = {Aleksandra Gorzkowska and
Michael A. Henning and
Monika Pilsniak and
Elzbieta Tumidajewicz},
title = {Paired domination stability in graphs},
journal = {Ars Math. Contemp.},
volume = {22},
number = {2},
pages = {2},
year = {2022},
url = {https://doi.org/10.26493/1855-3974.2522.eb3},
doi = {10.26493/1855-3974.2522.EB3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arsmc/GorzkowskaHPT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KalinowskiP22,
author = {Rafal Kalinowski and
Monika Pilsniak},
title = {Extremal graphs for the distinguishing index},
journal = {Discret. Math.},
volume = {345},
number = {8},
pages = {112905},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.112905},
doi = {10.1016/J.DISC.2022.112905},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/KalinowskiP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LehnerPS22,
author = {Florian Lehner and
Monika Pilsniak and
Marcin Stawiski},
title = {Corrigendum to "A bound for the distinguishing index of regular
graphs" [European J. Combin. 89 {(2020)} 103145]},
journal = {Eur. J. Comb.},
volume = {101},
pages = {103489},
year = {2022},
url = {https://doi.org/10.1016/j.ejc.2021.103489},
doi = {10.1016/J.EJC.2021.103489},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/LehnerPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GorzkowskaHKP22,
author = {Aleksandra Gorzkowska and
Michael A. Henning and
Elzbieta Kleszcz and
Monika Pilsniak},
title = {Paired Domination in Trees},
journal = {Graphs Comb.},
volume = {38},
number = {4},
pages = {129},
year = {2022},
url = {https://doi.org/10.1007/s00373-022-02542-7},
doi = {10.1007/S00373-022-02542-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GorzkowskaHKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LehnerPS22,
author = {Florian Lehner and
Monika Pilsniak and
Marcin Stawiski},
title = {Distinguishing infinite graphs with bounded degrees},
journal = {J. Graph Theory},
volume = {101},
number = {1},
pages = {52--65},
year = {2022},
url = {https://doi.org/10.1002/jgt.22809},
doi = {10.1002/JGT.22809},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LehnerPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/Pilsniak21,
author = {Monika Pilsniak},
title = {Nordhaus-Gaddum type inequalities for the distinguishing index},
journal = {Ars Math. Contemp.},
volume = {20},
number = {2},
pages = {223--231},
year = {2021},
url = {https://doi.org/10.26493/1855-3974.2173.71a},
doi = {10.26493/1855-3974.2173.71A},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arsmc/Pilsniak21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/ImrichKPW21,
author = {Wilfried Imrich and
Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak},
title = {On Asymmetric Colourings of Claw-Free Graphs},
journal = {Electron. J. Comb.},
volume = {28},
number = {3},
pages = {3},
year = {2021},
url = {https://doi.org/10.37236/8886},
doi = {10.37236/8886},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/ImrichKPW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/ImrichKPW20,
author = {Wilfried Imrich and
Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak},
title = {The distinguishing index of connected graphs without pendant edges},
journal = {Ars Math. Contemp.},
volume = {18},
number = {1},
pages = {117--126},
year = {2020},
url = {https://doi.org/10.26493/1855-3974.1852.4f7},
doi = {10.26493/1855-3974.1852.4F7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arsmc/ImrichKPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BaudonHMPPW20,
author = {Olivier Baudon and
Herv{\'{e}} Hocquard and
Antoni Marczyk and
Monika Pilsniak and
Jakub Przybylo and
Mariusz Wozniak},
title = {On a total version of 1-2-3 Conjecture},
journal = {Discuss. Math. Graph Theory},
volume = {40},
number = {4},
pages = {1175--1186},
year = {2020},
url = {https://doi.org/10.7151/dmgt.2223},
doi = {10.7151/DMGT.2223},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BaudonHMPPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/PilsniakT20,
author = {Monika Pilsniak and
Thomas W. Tucker},
title = {Distinguishing index of maps},
journal = {Eur. J. Comb.},
volume = {84},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2019.103034},
doi = {10.1016/J.EJC.2019.103034},
timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/PilsniakT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LehnerPS20,
author = {Florian Lehner and
Monika Pilsniak and
Marcin Stawiski},
title = {A bound for the distinguishing index of regular graphs},
journal = {Eur. J. Comb.},
volume = {89},
pages = {103145},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2020.103145},
doi = {10.1016/J.EJC.2020.103145},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/LehnerPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/PilsniakS20,
author = {Monika Pilsniak and
Marcin Stawiski},
title = {The optimal general upper bound for the distinguishing index of infinite
graphs},
journal = {J. Graph Theory},
volume = {93},
number = {4},
pages = {463--469},
year = {2020},
url = {https://doi.org/10.1002/jgt.22496},
doi = {10.1002/JGT.22496},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/PilsniakS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BroereIKP19,
author = {Izak Broere and
Wilfried Imrich and
Rafal Kalinowski and
Monika Pilsniak},
title = {Asymmetric colorings of products of graphs and digraphs},
journal = {Discret. Appl. Math.},
volume = {266},
pages = {56--64},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.12.023},
doi = {10.1016/J.DAM.2018.12.023},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BroereIKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/GorzkowskaKP17,
author = {Aleksandra Gorzkowska and
Rafal Kalinowski and
Monika Pilsniak},
title = {The distinguishing index of the Cartesian product of finite graphs},
journal = {Ars Math. Contemp.},
volume = {12},
number = {1},
pages = {77--87},
year = {2017},
url = {https://doi.org/10.26493/1855-3974.909.0e1},
doi = {10.26493/1855-3974.909.0E1},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/GorzkowskaKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/BroereP17,
author = {Izak Broere and
Monika Pilsniak},
title = {The distinguishing index of the Cartesian product of countable graphs},
journal = {Ars Math. Contemp.},
volume = {13},
number = {1},
pages = {15--21},
year = {2017},
url = {https://doi.org/10.26493/1855-3974.792.403},
doi = {10.26493/1855-3974.792.403},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/BroereP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/Pilsniak17,
author = {Monika Pilsniak},
title = {Improving upper bounds for the distinguishing index},
journal = {Ars Math. Contemp.},
volume = {13},
number = {2},
pages = {259--274},
year = {2017},
url = {https://doi.org/10.26493/1855-3974.981.ff0},
doi = {10.26493/1855-3974.981.FF0},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/Pilsniak17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/ImrichKPS17,
author = {Wilfried Imrich and
Rafal Kalinowski and
Monika Pilsniak and
Mohammad Hadi Shekarriz},
title = {Bounds for Distinguishing Invariants of Infinite Graphs},
journal = {Electron. J. Comb.},
volume = {24},
number = {3},
pages = {3},
year = {2017},
url = {https://doi.org/10.37236/6362},
doi = {10.37236/6362},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/ImrichKPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaudonPPSSW17,
author = {Olivier Baudon and
Monika Pilsniak and
Jakub Przybylo and
Mohammed Senhaji and
{\'{E}}ric Sopena and
Mariusz Wozniak},
title = {Equitable neighbour-sum-distinguishing edge and total colourings},
journal = {Discret. Appl. Math.},
volume = {222},
pages = {40--53},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.01.031},
doi = {10.1016/J.DAM.2017.01.031},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BaudonPPSSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KalinowskiPW17,
author = {Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak},
title = {A note on breaking small automorphisms in graphs},
journal = {Discret. Appl. Math.},
volume = {232},
pages = {221--225},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.07.034},
doi = {10.1016/J.DAM.2017.07.034},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KalinowskiPW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BaudonBFP17,
author = {Olivier Baudon and
Julien Bensmail and
Florent Foucaud and
Monika Pilsniak},
title = {Structural properties of recursively partitionable graphs with connectivity
2},
journal = {Discuss. Math. Graph Theory},
volume = {37},
number = {1},
pages = {89--115},
year = {2017},
url = {https://doi.org/10.7151/dmgt.1925},
doi = {10.7151/DMGT.1925},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BaudonBFP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/EstajiIKPT17,
author = {Ehsan Estaji and
Wilfried Imrich and
Rafal Kalinowski and
Monika Pilsniak and
Thomas W. Tucker},
title = {Distinguishing Cartesian products of countable graphs},
journal = {Discuss. Math. Graph Theory},
volume = {37},
number = {1},
pages = {155--164},
year = {2017},
url = {https://doi.org/10.7151/dmgt.1902},
doi = {10.7151/DMGT.1902},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/EstajiIKPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Pilsniak17,
author = {Monika Pilsniak},
title = {Edge motion and the distinguishing index},
journal = {Theor. Comput. Sci.},
volume = {678},
pages = {56--62},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.02.032},
doi = {10.1016/J.TCS.2017.02.032},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Pilsniak17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GorzkowskaP17,
author = {Aleksandra Gorzkowska and
Monika Pilsniak},
title = {Precise bounds for the distinguishing index of the Cartesian product},
journal = {Theor. Comput. Sci.},
volume = {687},
pages = {62--69},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.05.004},
doi = {10.1016/J.TCS.2017.05.004},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GorzkowskaP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaudonPPSSW17,
author = {Olivier Baudon and
Monika Pilsniak and
Jakub Przybylo and
Mohammed Senhaji and
{\'{E}}ric Sopena and
Mariusz Wozniak},
title = {Equitable neighbour-sum-distinguishing edge and total colourings},
journal = {CoRR},
volume = {abs/1701.04648},
year = {2017},
url = {http://arxiv.org/abs/1701.04648},
eprinttype = {arXiv},
eprint = {1701.04648},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaudonPPSSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/KalinowskiPW16,
author = {Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak},
title = {Distinguishing graphs by total colourings},
journal = {Ars Math. Contemp.},
volume = {11},
number = {1},
pages = {79--89},
year = {2016},
url = {https://doi.org/10.26493/1855-3974.751.9a8},
doi = {10.26493/1855-3974.751.9A8},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/KalinowskiPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KalinowskiPW16,
author = {Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak},
title = {Preface},
journal = {Discret. Math.},
volume = {339},
number = {7},
pages = {1827},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2016.02.017},
doi = {10.1016/J.DISC.2016.02.017},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KalinowskiPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/KalinowskiPSW16,
author = {Rafal Kalinowski and
Monika Pilsniak and
Ingo Schiermeyer and
Mariusz Wozniak},
title = {Dense arbitrarily partitionable graphs},
journal = {Discuss. Math. Graph Theory},
volume = {36},
number = {1},
pages = {5--22},
year = {2016},
url = {https://doi.org/10.7151/dmgt.1833},
doi = {10.7151/DMGT.1833},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/KalinowskiPSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BroereP15,
author = {Izak Broere and
Monika Pilsniak},
title = {The Distinguishing Index of Infinite Graphs},
journal = {Electron. J. Comb.},
volume = {22},
number = {1},
pages = {1},
year = {2015},
url = {https://doi.org/10.37236/3933},
doi = {10.37236/3933},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BroereP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KalinowskiP15,
author = {Rafal Kalinowski and
Monika Pilsniak},
title = {Distinguishing graphs by edge-colourings},
journal = {Eur. J. Comb.},
volume = {45},
pages = {124--131},
year = {2015},
url = {https://doi.org/10.1016/j.ejc.2014.11.003},
doi = {10.1016/J.EJC.2014.11.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KalinowskiP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/PilsniakW15,
author = {Monika Pilsniak and
Mariusz Wozniak},
title = {On the Total-Neighbor-Distinguishing Index by Sums},
journal = {Graphs Comb.},
volume = {31},
number = {3},
pages = {771--782},
year = {2015},
url = {https://doi.org/10.1007/s00373-013-1399-4},
doi = {10.1007/S00373-013-1399-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/PilsniakW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/ImrichKLP14,
author = {Wilfried Imrich and
Rafal Kalinowski and
Florian Lehner and
Monika Pilsniak},
title = {Endomorphism Breaking in Graphs},
journal = {Electron. J. Comb.},
volume = {21},
number = {1},
pages = {1},
year = {2014},
url = {https://doi.org/10.37236/3073},
doi = {10.37236/3073},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/ImrichKLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KalinowskiPPW14,
author = {Rafal Kalinowski and
Monika Pilsniak and
Jakub Przybylo and
Mariusz Wozniak},
title = {How to personalize the vertices of a graph?},
journal = {Eur. J. Comb.},
volume = {40},
pages = {116--123},
year = {2014},
url = {https://doi.org/10.1016/j.ejc.2014.02.008},
doi = {10.1016/J.EJC.2014.02.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KalinowskiPPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KalinowskiPPW13,
author = {Rafal Kalinowski and
Monika Pilsniak and
Jakub Przybylo and
Mariusz Wozniak},
title = {Can Colour-Blind Distinguish Colour Palettes?},
journal = {Electron. J. Comb.},
volume = {20},
number = {3},
pages = {23},
year = {2013},
url = {https://doi.org/10.37236/2319},
doi = {10.37236/2319},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/KalinowskiPPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KalinowskiPW12,
author = {Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak},
title = {Preface},
journal = {Discret. Math.},
volume = {312},
number = {14},
pages = {2091},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.03.004},
doi = {10.1016/J.DISC.2012.03.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KalinowskiPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BorowieckiGP12,
author = {Mieczyslaw Borowiecki and
Jaroslaw Grytczuk and
Monika Pilsniak},
title = {Coloring chip configurations on graphs and digraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {1--4},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.09.011},
doi = {10.1016/J.IPL.2011.09.011},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BorowieckiGP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/PilsniakW11,
author = {Monika Pilsniak and
Mariusz Wozniak},
title = {On packing of two copies of a hypergraph},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {13},
number = {3},
pages = {67--74},
year = {2011},
url = {https://doi.org/10.46298/dmtcs.537},
doi = {10.46298/DMTCS.537},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/PilsniakW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GorlichP10,
author = {Agnieszka G{\"{o}}rlich and
Monika Pilsniak},
title = {A note on an embedding problem in transitive tournaments},
journal = {Discret. Math.},
volume = {310},
number = {4},
pages = {681--686},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.08.017},
doi = {10.1016/J.DISC.2009.08.017},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GorlichP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KalinowskiPWZ09,
author = {Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak and
Irmina A. Ziolo},
title = {Arbitrarily vertex decomposable suns with few rays},
journal = {Discret. Math.},
volume = {309},
number = {11},
pages = {3726--3732},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.02.019},
doi = {10.1016/J.DISC.2008.02.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KalinowskiPWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KalinowskiPWZ09a,
author = {Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak and
Irmina A. Ziolo},
title = {On-line arbitrarily vertex decomposable suns},
journal = {Discret. Math.},
volume = {309},
number = {22},
pages = {6328--6336},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.11.025},
doi = {10.1016/J.DISC.2008.11.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KalinowskiPWZ09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/GorlichKMPW07,
author = {Agnieszka G{\"{o}}rlich and
Rafal Kalinowski and
Mariusz Meszka and
Monika Pilsniak and
Mariusz Wozniak},
title = {A note on decompositions of transitive tournaments {II}},
journal = {Australas. {J} Comb.},
volume = {37},
pages = {57--66},
year = {2007},
url = {http://ajc.maths.uq.edu.au/pdf/37/ajc\_v37\_p057.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/GorlichKMPW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GorlichKMPW07,
author = {Agnieszka G{\"{o}}rlich and
Rafal Kalinowski and
Mariusz Meszka and
Monika Pilsniak and
Mariusz Wozniak},
title = {A note on decompositions of transitive tournaments},
journal = {Discret. Math.},
volume = {307},
number = {7-8},
pages = {896--904},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.11.045},
doi = {10.1016/J.DISC.2005.11.045},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GorlichKMPW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Pilsniak07,
author = {Monika Pilsniak},
title = {Packing of two digraphs into a transitive tournament},
journal = {Discret. Math.},
volume = {307},
number = {7-8},
pages = {971--974},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.11.038},
doi = {10.1016/J.DISC.2005.11.038},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Pilsniak07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GorlichPWZ07,
author = {Agnieszka G{\"{o}}rlich and
Monika Pilsniak and
Mariusz Wozniak and
Irmina A. Ziolo},
title = {Fixed-point-free embeddings of digraphs with small size},
journal = {Discret. Math.},
volume = {307},
number = {11-12},
pages = {1332--1340},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.11.070},
doi = {10.1016/J.DISC.2005.11.070},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GorlichPWZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/PilsniakW07,
author = {Monika Pilsniak and
Mariusz Wozniak},
title = {A note on packing of two copies of a hypergraph},
journal = {Discuss. Math. Graph Theory},
volume = {27},
number = {1},
pages = {45--49},
year = {2007},
url = {https://doi.org/10.7151/dmgt.1343},
doi = {10.7151/DMGT.1343},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/PilsniakW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GorlichPW06,
author = {Agnieszka G{\"{o}}rlich and
Monika Pilsniak and
Mariusz Wozniak},
title = {A Note on a Packing Problem in Transitive Tournaments},
journal = {Graphs Comb.},
volume = {22},
number = {2},
pages = {233--239},
year = {2006},
url = {https://doi.org/10.1007/s00373-005-0652-x},
doi = {10.1007/S00373-005-0652-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GorlichPW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KalinowskiPWZ05,
author = {Rafal Kalinowski and
Monika Pilsniak and
Mariusz Wozniak and
Irmina A. Ziolo},
title = {Some families of arbitrarily vertex decomposable graphs},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {451--454},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.100},
doi = {10.1016/J.ENDM.2005.06.100},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KalinowskiPWZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GorlichPWZ04,
author = {Agnieszka G{\"{o}}rlich and
Monika Pilsniak and
Mariusz Wozniak and
Irmina A. Ziolo},
title = {A note on embedding graphs without short cycles},
journal = {Discret. Math.},
volume = {286},
number = {1-2},
pages = {75--77},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.11.048},
doi = {10.1016/J.DISC.2003.11.048},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GorlichPWZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Pilsniak04,
author = {Monika Pilsniak},
title = {Packing of three copies of a digraph into the transitive tournament},
journal = {Discuss. Math. Graph Theory},
volume = {24},
number = {3},
pages = {443--456},
year = {2004},
url = {https://doi.org/10.7151/dmgt.1243},
doi = {10.7151/DMGT.1243},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Pilsniak04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/GorlichPW03,
author = {Agnieszka G{\"{o}}rlich and
Monika Pilsniak and
Mariusz Wozniak},
title = {On cyclically embeddable (n, n)-graphs},
journal = {Discuss. Math. Graph Theory},
volume = {23},
number = {1},
pages = {85--104},
year = {2003},
url = {https://doi.org/10.7151/dmgt.1187},
doi = {10.7151/DMGT.1187},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/GorlichPW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
