Articles
5-21
Colouring of cycles in the de Bruijn graphs
23-38
The strong isometric dimension of finite reflexive graphs
39-56
Recognizing weighted directed cartesian graph bundles
57-69
Mean value for the matching and dominating polynomial
71-79
Some news about the independence number of a graph
81-91
About uniquely colorable mixed hypertrees
93-103
Classes of hypergraphs with sum number one
105-107
Long induced paths in 3-connected planar graphs
109-128
A class of tight circulant tournaments
129-138
Geodetic sets in graphs
139-142
Some results concerning the ends of minimal cuts of simple graphs
143-154
Unique factorization theorem
155-159