BibTeX records: Monika Pilsniak

download as .bib file

@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 = {Thu, 10 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/arsmc/GorzkowskaKP17},
  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 = {Thu, 10 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/arsmc/BroereP17},
  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 = {Thu, 10 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/arsmc/Pilsniak17},
  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   = {Electr. J. Comb.},
  volume    = {24},
  number    = {3},
  pages     = {P3.6},
  year      = {2017},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p6},
  timestamp = {Tue, 15 Aug 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/ImrichKPS17},
  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   = {Discrete Applied Mathematics},
  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, 28 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dam/BaudonPPSSW17},
  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   = {Discrete Applied Mathematics},
  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 = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dam/KalinowskiPW17},
  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   = {Discussiones Mathematicae 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 = {Wed, 20 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/BaudonBFP17},
  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   = {Discussiones Mathematicae 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 = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/EstajiIKPT17},
  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, 11 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/Pilsniak17},
  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 = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/GorzkowskaP17},
  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},
  archivePrefix = {arXiv},
  eprint    = {1701.04648},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BaudonPPSSW17},
  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 = {Thu, 10 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/arsmc/KalinowskiPW16},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/KalinowskiPW16},
  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   = {Discussiones Mathematicae 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/KalinowskiPSW16},
  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   = {Electr. J. Comb.},
  volume    = {22},
  number    = {1},
  pages     = {P1.78},
  year      = {2015},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p78},
  timestamp = {Tue, 28 Apr 2015 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/BroereP15},
  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, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/KalinowskiP15},
  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 and Combinatorics},
  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 = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/gc/PilsniakW15},
  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   = {Electr. J. Comb.},
  volume    = {21},
  number    = {1},
  pages     = {P1.16},
  year      = {2014},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p16},
  timestamp = {Mon, 10 Mar 2014 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/ImrichKLP14},
  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, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/KalinowskiPPW14},
  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   = {Electr. J. Comb.},
  volume    = {20},
  number    = {3},
  pages     = {P23},
  year      = {2013},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p23},
  timestamp = {Tue, 17 Sep 2013 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/KalinowskiPPW13},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/KalinowskiPW12},
  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 = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/BorowieckiGP12},
  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   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {13},
  number    = {3},
  pages     = {67--74},
  year      = {2011},
  url       = {http://dmtcs.episciences.org/537},
  timestamp = {Thu, 11 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/PilsniakW11},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/GorlichP10},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/KalinowskiPWZ09},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/KalinowskiPWZ09a},
  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   = {Australasian J. Combinatorics},
  volume    = {37},
  pages     = {57--66},
  year      = {2007},
  url       = {http://ajc.maths.uq.edu.au/pdf/37/ajc\_v37\_p057.pdf},
  timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ajc/GorlichKMPW07},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/GorlichKMPW07},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/Pilsniak07},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/GorlichPWZ07},
  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   = {Discussiones Mathematicae 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/PilsniakW07},
  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 and Combinatorics},
  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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/gc/GorlichPW06},
  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   = {Electronic Notes in Discrete Mathematics},
  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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/KalinowskiPWZ05},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/GorlichPWZ04},
  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   = {Discussiones Mathematicae 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/Pilsniak04},
  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   = {Discussiones Mathematicae 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/GorlichPW03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier