5 | -- | 6 | Ewa Drgas-Burchardt, Mariusz Haluszczak, Maria Kwasnik, Danuta Michalak, Elzbieta Sidorowicz. Preface |
7 | -- | 0 | Izak Broere, Peter Mihók. Hereditarnia |
9 | -- | 23 | Kinnari Amin, Jill R. Faudree, Ronald J. Gould, Elzbieta Sidorowicz. p-free graphs |
25 | -- | 31 | József Balogh, Alexandr V. Kostochka, Andrei Raigorodskii. n |
33 | -- | 47 | Izak Broere, Johannes Heidema. Universality for and in induced-hereditary graph properties |
49 | -- | 55 | Ewa Drgas-Burchardt. A note on the uniqueness of stable marriage matching |
57 | -- | 69 | Reinhardt Euler, Pawel Oleksik. × n latin rectangle completable? |
71 | -- | 89 | Igor Fabrici, Erhard Hexel, Stanislav Jendrol. On vertices enforcing a Hamiltonian cycle |
91 | -- | 99 | Anna Fiedorowicz. Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree |
101 | -- | 115 | Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda. q, k) stable graphs |
117 | -- | 131 | Marietjie Frick. A survey of the Path Partition Conjecture |
133 | -- | 137 | Jochen Harant. A note on Barnette's Conjecture |
139 | -- | 146 | Michael A. Henning, Douglas F. Rall. On graphs with disjoint dominating and 2-dominating sets |
147 | -- | 165 | Mirko Hornák, Stanislav Jendrol, Ingo Schiermeyer. On maximum weight of a bipartite graph of given order and size |
167 | -- | 179 | Arnfried Kemnitz, Peter Mihók, Margit Voigt. P, Q)-total list colorings of graphs |
181 | -- | 192 | Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak. Rainbow connection in sparse graphs |
193 | -- | 201 | Justyna Otfinowska, Mariusz Wozniak. A note on uniquely embeddable forests |
203 | -- | 215 | Mirka Miller, Joe Ryan, Zdenek Ryjácek. Distance-locally disconnected graphs |
217 | -- | 229 | Zdzislaw Skupien. Sums of powered characteristic roots count distance-independent circular sets |
231 | -- | 242 | Zsolt Tuza. Choice-perfect graphs |