Sommaire du Fascicule no. 1

Grundy number of graphs
p. 5
Global alliances and independence in trees
p. 19
New sufficient conditions for hamiltonian and pancyclic graphs
p. 29
A note on uniquely H-colourable graphs
p. 39
A note on packing of two copies of a hypergraph
p. 45
Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$
p. 51
Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
p. 69
Trees with equal restrained domination and total restrained domination numbers
p. 83
Characterization of block graphs with equal 2-domination number and domination number plus one
p. 93
Linear and cyclic radio k-labelings of trees
p. 105
Orientation distance graphs revisited
p. 125
A new upper bound for the chromatic number of a graph
p. 137
Spectral study of alliances in graphs
p. 143
Improved upper bounds for nearly antipodal chromatic number of paths
p. 159
Total domination of Cartesian products of graphs
p. 175
Cycles through specified vertices in triangle-free graphs
p. 179
More on even [a,b]-factors in graphs
p. 193

Sommaire du Fascicule no. 2

On distance local connectivity and vertex distance colouring
p. 209
Variations on a sufficient condition for Hamiltonian graphs
p. 229
Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails
p. 241
Further results on sequentially additive graphs
p. 251
Erdős regular graphs of even degree
p. 269
Subgraph densities in hypergraphs
p. 281
Infinite families of tight regular tournaments
p. 299
On θ-graphs of partial cubes
p. 313
Vertex-dominating cycles in 2-connected bipartite graphs
p. 323
Edge-connectivity of strong products of graphs
p. 333
Histories in path graphs
p. 345
(k,l)-kernels, (k,l)-semikernels, k-Grundy functions and duality for state splittings
p. 359
On the second largest eigenvalue of a mixed graph
p. 373

Sommaire du Fascicule no. 3

Monochromatic kernel-perfectness of special classes of digraphs
p. 389
The Chvátal-Erdős condition and 2-factors with a specified number of components
p. 401
Efficient (j,k)-domination
p. 409
Some totally 4-choosable multigraphs
p. 425
On (k,l)-kernels in D-join of digraphs
p. 457
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
p. 471
Distance defined by spanning trees in graphs
p. 485
The structure and existence of 2-factors in iterated line graphs
p. 507
Counterexample to a conjecture on the structure of bipartite partitionable graphs
p. 527
Fractional domination in prisms
p. 541
A proof of the crossing number of $K_{3,n}$ in a surface
p. 549
An approximation algorithm for the total covering problem
p. 553
'3in1' enhanced: three squared ways to '3in1' GRAPHS
p. 561
The representation of multi-hypergraphs by set intersections
p. 565
Magic and supermagic dense bipartite graphs
p. 583
Factoring directed graphs with respect to the cardinal product in polynomial time
p. 593
Minimal non-selfcentric radially-maximal graphs of radius 4
p. 603
A Sokoban-type game and arc deletion within irregular digraphs of all sizes
p. 611
Preface to proceedings
p. 559