Articles
5-18
Grundy number of graphs
19-27
Global alliances and independence in trees
29-38
New sufficient conditions for hamiltonian and pancyclic graphs
39-44
A note on uniquely H-colourable graphs
45-49
A note on packing of two copies of a hypergraph
51-67
Digraphs with isomorphic underlying and domination graphs: connected
69-82
Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
83-91
Trees with equal restrained domination and total restrained domination numbers
93-103
Characterization of block graphs with equal 2-domination number and domination number plus one
105-123
Linear and cyclic radio k-labelings of trees
125-136
Orientation distance graphs revisited
137-142
A new upper bound for the chromatic number of a graph
143-157
Spectral study of alliances in graphs
159-174
Improved upper bounds for nearly antipodal chromatic number of paths
175-178
Total domination of Cartesian products of graphs
179-191
Cycles through specified vertices in triangle-free graphs
193-204