E. Drgas-Burchardt, M. Hałuszczak, M. Kwaśnik, D. Michalak, E. Sidorowicz

Preface

I. Broere, P. Mihók

Hereditarnia

K. Amin, J. Faudree, R. J. Gould, E. Sidorowicz

On the non-($p-1$)-partite $K_{p}$-free graphs

J. Balogh, A.V. Kostochka, A. Raigorodskii

Coloring some finite sets in $\cal R^{n} $

I. Broere, J. Heidema

Universality for and in induced-hereditary graph properties

E. Drgas-Burchardt

A note on the uniqueness of stable marriage matching

R. Euler, P. Oleksik

When is an incomplete 3$× n$ latin rectangle completable?

I. Fabrici, E. Hexel, S. Jendrol'

On vertices enforcing a Hamiltonian cycle

A. Fiedorowicz

Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree

J.L. Fouquet, H. Thuiller, J.M. Vanherpe, A.P. Wojda

On minimum ($K_q,k$) stable graphs

M. Frick

A survey of the Path Partition Conjecture

J. Harant

A note on Barnette's Conjecture

M.A. Henning, D.F. Rall

On graphs with disjoint dominating and 2-dominating sets

M. Horňák, S. Jendrol', I. Schiermeyer

On maximum weight of a bipartite graph of given order and size

A. Kemnitz, P. Mihók, M. Voigt

Fractional (${\cal P},{\cal Q}$)-total list colorings of graphs

A. Kemnitz, J. Przybyło, I. Schiermeyer, M. Woźniak

Rainbow connection in sparse graphs

J. Otfinowska, M. Woźniak

A note on uniquely embeddable forests

M. Miller, J. Ryan, Z. Ryjáček

Distance-locally disconnected graphs

Z. Skupień

Sums of powered characteristic roots count distance-independent circular sets

Zs. Tuza

Choice-perfect graphs