BibTeX records: Mariusz Haluszczak

download as .bib file

@article{DBLP:journals/dam/Borowiecka-Olszewska16,
  author    = {Marta Borowiecka{-}Olszewska and
               Ewa Drgas{-}Burchardt and
               Mariusz Haluszczak},
  title     = {On the structure and deficiency of k-trees with bounded degree},
  journal   = {Discret. Appl. Math.},
  volume    = {201},
  pages     = {24--37},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.dam.2015.08.008},
  doi       = {10.1016/j.dam.2015.08.008},
  timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dam/Borowiecka-Olszewska16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Borowiecka-OlszewskaH13,
  author    = {Marta Borowiecka{-}Olszewska and
               Mariusz Haluszczak},
  title     = {On Ramsey (\emph{K}\({}_{\mbox{1, \emph{m}}}\), \emph{G})(K1, m, G)-minimal
               graphs},
  journal   = {Discret. Math.},
  volume    = {313},
  number    = {19},
  pages     = {1843--1855},
  year      = {2013},
  url       = {https://doi.org/10.1016/j.disc.2012.06.020},
  doi       = {10.1016/j.disc.2012.06.020},
  timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dm/Borowiecka-OlszewskaH13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Drgas-BurchardtHKMS13,
  author    = {Ewa Drgas{-}Burchardt and
               Mariusz Haluszczak and
               Maria Kwasnik and
               Danuta Michalak and
               Elzbieta Sidorowicz},
  title     = {Preface},
  journal   = {Discussiones Mathematicae Graph Theory},
  volume    = {33},
  number    = {1},
  pages     = {5--6},
  year      = {2013},
  url       = {https://doi.org/10.7151/dmgt.1676},
  doi       = {10.7151/dmgt.1676},
  timestamp = {Wed, 22 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/dmgt/Drgas-BurchardtHKMS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Haluszczak12,
  author    = {Mariusz Haluszczak},
  title     = {On Ramsey (\emph{K\({}_{\mbox{1, 2}}\), K\({}_{\mbox{n}}\)})-minimal
               graphs},
  journal   = {Discussiones Mathematicae Graph Theory},
  volume    = {32},
  number    = {2},
  pages     = {331--339},
  year      = {2012},
  url       = {https://doi.org/10.7151/dmgt.1604},
  doi       = {10.7151/dmgt.1604},
  timestamp = {Wed, 22 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/dmgt/Haluszczak12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FiedorowiczH12,
  author    = {Anna Fiedorowicz and
               Mariusz Haluszczak},
  title     = {Acyclic chromatic indices of fully subdivided graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {112},
  number    = {13},
  pages     = {557--561},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.ipl.2012.04.004},
  doi       = {10.1016/j.ipl.2012.04.004},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/FiedorowiczH12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Drgas-BurchardtHM10,
  author    = {Ewa Drgas{-}Burchardt and
               Mariusz Haluszczak and
               Peter Mih{\'{o}}k},
  title     = {Minimal forbidden graphs of reducible additive hereditary graph properties},
  journal   = {Ars Comb.},
  volume    = {95},
  year      = {2010},
  timestamp = {Wed, 06 Mar 2013 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/arscom/Drgas-BurchardtHM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BorowieckiFH09,
  author    = {Mieczyslaw Borowiecki and
               Anna Fiedorowicz and
               Mariusz Haluszczak},
  title     = {Acyclic reducible bounds for outerplanar graphs},
  journal   = {Discussiones Mathematicae Graph Theory},
  volume    = {29},
  number    = {2},
  pages     = {219--239},
  year      = {2009},
  url       = {https://doi.org/10.7151/dmgt.1443},
  doi       = {10.7151/dmgt.1443},
  timestamp = {Wed, 22 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/dmgt/BorowieckiFH09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FiedorowiczHN08,
  author    = {Anna Fiedorowicz and
               Mariusz Haluszczak and
               Narayanan Narayanan},
  title     = {About acyclic edge colourings of planar graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {108},
  number    = {6},
  pages     = {412--417},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.ipl.2008.07.016},
  doi       = {10.1016/j.ipl.2008.07.016},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ipl/FiedorowiczHN08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GrytczukHK04,
  author    = {Jaroslaw Grytczuk and
               Mariusz Haluszczak and
               Henry A. Kierstead},
  title     = {On-line Ramsey Theory},
  journal   = {Electr. J. Comb.},
  volume    = {11},
  number    = {1},
  year      = {2004},
  url       = {http://www.combinatorics.org/Volume\_11/Abstracts/v11i1r57.html},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorics/GrytczukHK04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BorowieckiHS04,
  author    = {Mieczyslaw Borowiecki and
               Mariusz Haluszczak and
               Elzbieta Sidorowicz},
  title     = {On Ramsey minimal graphs},
  journal   = {Discret. Math.},
  volume    = {286},
  number    = {1-2},
  pages     = {37--43},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.disc.2003.11.043},
  doi       = {10.1016/j.disc.2003.11.043},
  timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dm/BorowieckiHS04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BorowieckiGHT03,
  author    = {Mieczyslaw Borowiecki and
               Jaroslaw Grytczuk and
               Mariusz Haluszczak and
               Zsolt Tuza},
  title     = {Sch{\"{u}}tte's Tournament Problem and Intersecting Families
               of Sets},
  journal   = {Comb. Probab. Comput.},
  volume    = {12},
  number    = {4},
  pages     = {359--364},
  year      = {2003},
  url       = {https://doi.org/10.1017/S0963548303005674},
  doi       = {10.1017/S0963548303005674},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cpc/BorowieckiGHT03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonGHR02,
  author    = {Noga Alon and
               Jaroslaw Grytczuk and
               Mariusz Haluszczak and
               Oliver Riordan},
  title     = {Nonrepetitive colorings of graphs},
  journal   = {Random Struct. Algorithms},
  volume    = {21},
  number    = {3-4},
  pages     = {336--346},
  year      = {2002},
  url       = {https://doi.org/10.1002/rsa.10057},
  doi       = {10.1002/rsa.10057},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/rsa/AlonGHR02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BorowieckiHS00,
  author    = {Mieczyslaw Borowiecki and
               Mariusz Haluszczak and
               Miroslawa Skowronska},
  title     = {Minimal reducible bounds for 1-nonouterplanar graphs},
  journal   = {Discret. Math.},
  volume    = {219},
  number    = {1-3},
  pages     = {9--15},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0012-365X(99)00364-7},
  doi       = {10.1016/S0012-365X(99)00364-7},
  timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dm/BorowieckiHS00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HaluszczakV99,
  author    = {Mariusz Haluszczak and
               Pavol Vateha},
  title     = {On the completeness of decomposable properties of graphs},
  journal   = {Discussiones Mathematicae Graph Theory},
  volume    = {19},
  number    = {2},
  pages     = {229--236},
  year      = {1999},
  url       = {https://doi.org/10.7151/dmgt.1097},
  doi       = {10.7151/dmgt.1097},
  timestamp = {Wed, 22 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/dmgt/HaluszczakV99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BorowieckiH97,
  author    = {Piotr Borowiecki and
               Mariusz Haluszczak},
  title     = {Partitions of some planar graphs into two linear forests},
  journal   = {Discussiones Mathematicae Graph Theory},
  volume    = {17},
  number    = {1},
  pages     = {95--102},
  year      = {1997},
  url       = {https://doi.org/10.7151/dmgt.1042},
  doi       = {10.7151/dmgt.1042},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/dmgt/BorowieckiH97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics