@article {IOPORT.05228249,
    author       = {Borowiecki, Mieczys\l aw and Fiedorowicz, Anna},
    title        = {On partitions of hereditary properties of graphs.},
    year         = {2006},
    journal      = {Discussiones Mathematicae. Graph Theory},
    volume       = {26},
    number       = {3},
    issn         = {1234-3099},
    pages        = {377-387},
    publisher    = {University of Zielona G\'ora Press, Zielona G\'ora},
    doi          = {10.7151/dmgt.1330},
    abstract     = {A hereditary property of graphs is any class of graphs that is closed with respect to taking isomorphisms and subgraphs. It is known that every hereditary property $\Cal P$ can be uniquely determined by its set of minimal forbidden graphs, denoted by $F({\Cal P})$. A hereditary property ${\Cal P}$ is called ${\Cal Q}$-Ramsey class if for every $G\in{\Cal P}$ there is an $H\in {\Cal P}$ such that for every ${F}({\Cal Q})$-free bicolouring of $H$ there is a monochromatic subgraph of $H$ isomorphic to $G$. Some pairs of hereditary properties of graphs (including outerplanar graphs, acyclic graphs, edgeless graphs, $k$-colourable graphs) are considered. For some of them there are presented positive results and for some combinations negative results are obtained. The negative results motivate a study of a new concept -- acyclic reducible bounds. Some results concerning this area are presented as well.},
    reviewer     = {Gabriel Semani\v sin (Ko\v sice)},
    identifier   = {05228249},
}