Sommaire du Fascicule no. 1

Algorithmic aspects of total-subdomination in graphs
p. 5
An anti-Ramsey theorem on edge-cuts
p. 19
Extension of several sufficient conditions for Hamiltonian graphs
p. 23
A characterization of planar median graphs
p. 41
Spectral integral variation of trees
p. 49
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
p. 59
Chvátal's Condition cannot hold for both a graph and its complement
p. 73
Leaps: an approach to the block structure of a graph
p. 77
The use of Euler's formula in (3,1)*-list coloring
p. 91
Some results on total domination in direct products of graphs
p. 103
On the basis number and the minimum cycle bases of the wreath product of some graphs i
p. 113
A prime factor theorem for a generalized direct product
p. 135
Decomposing complete graphs into cubes
p. 141
Optimal edge ranking of complete bipartite graphs in polynomial time
p. 149
Wiener index of generalized stars and their quadratic line graphs
p. 161

Sommaire du Fascicule no. 2

Extremal bipartite graphs with a unique k-factor
p. 181
In-degree sequence in a general model of a random digraph
p. 193
A lower bound for the irredundance number of trees
p. 209
Self-complementary hypergraphs
p. 217
An upper bound for maximum number of edges in a strongly multiplicative graph
p. 225
Isomorphic components of direct products of bipartite graphs
p. 231
On stratification and domination in graphs
p. 249
On a perfect problem
p. 273
On uniquely partitionable relational structures and object systems
p. 281
Arbitrarily vertex decomposable caterpillars with four or five leaves
p. 291
Graphs with convex domination number close to their order
p. 307
Extremum degree sets of irregular oriented graphs and pseudodigraphs
p. 317
Chvátal-Erdos condition and pancyclism
p. 335
Orthogonal double covers of complete graphs by fat caterpillars
p. 343
Problem presented at the workshop in Krynica 2004
p. 351
Preface to proceedings
p. 279

Sommaire du Fascicule no. 3

Arc-transitive and s-regular Cayley graphs of valency five on Abelian groups
p. 359
The cost chromatic number and hypergraph parameters
p. 369
On partitions of hereditary properties of graphs
p. 377
On-line 𝓟-coloring of graphs
p. 389
On arbitrarily vertex decomposable unicyclic graphs with dominating cycle
p. 403
A note on joins of additive hereditary graph properties
p. 413
The upper domination Ramsey number u(4,4)
p. 419
A lower bound on the independence number of a graph in terms of degrees
p. 431
Combinatorial lemmas for polyhedrons I
p. 439
Total edge irregularity strength of trees
p. 449
Some recent results on domination in graphs
p. 457
Preface
p. 357