Sommaire du Fascicule no. 1

Radio k-colorings of paths
p. 5
Hamilton cycles in split graphs with large minimum degree
p. 23
Characterizations of planar plick graphs
p. 41
Forbidden triples implying Hamiltonicity: for all graphs
p. 47
On traceability and 2-factors in claw-free graphs
p. 55
On the heterochromatic number of circulant digraphs
p. 73
A note on strongly multiplicative graphs
p. 81
Light classes of generalized stars in polyhedral maps on surfaces
p. 85
Some applications of pq-groups in graph theory
p. 109
A note on minimally 3-connected graphs
p. 115
A note on total colorings of planar graphs without 4-cycles
p. 125
A simple linear algorithm for the connected domination problem in circular-arc graphs
p. 137
Generalised irredundance in graphs: Nordhaus-Gaddum bounds
p. 147

Sommaire du Fascicule no. 2

Lower bound on the domination number of a tree
p. 165
Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel
p. 171
New lower bounds on the weighted chromatic number of a graph
p. 183
Pₘ-saturated bipartite graphs with minimum size
p. 197
Bounds for index of a modified graph
p. 213
Minimal regular graphs with given girths and crossing numbers
p. 223
Hereditary domination and independence parameters
p. 239
Vertex-disjoint copies of K¯₄
p. 249
Offensive alliances in graphs
p. 263
Cycle-pancyclism in bipartite tournaments I
p. 277
Graphs with small additive stretch number
p. 291
On the domination number of prisms of graphs
p. 303
Unique factorisation of additive induced-hereditary properties
p. 319
Cyclic decompositions of complete graphs into spanning trees
p. 345

Sommaire du Fascicule no. 3

Linear forests and ordered cycles
p. 359
Analogues of cliques for oriented coloring
p. 373
On dominating the Cartesian product of a graph and K₂
p. 389
On the structure of plane graphs of minimum face size 5
p. 403
On 3-simplicial vertices in planar graphs
p. 413
Some remarks on α-domination
p. 423
Even [a,b]-factors in graphs
p. 431
Packing of three copies of a digraph into the transitive tournament
p. 443
Total domination subdivision numbers of graphs
p. 457
Short paths in 3-uniform quasi-random hypergraphs
p. 469
Dominant-matching graphs
p. 485
Centers of n-fold tensor products of graphs
p. 491
Graphs without induced P₅ and C₅
p. 503
Difference labelling of digraphs
p. 509
Cycle-pancyclism in bipartite tournaments II
p. 529
A Gallai-type equality for the total domination number of a graph
p. 539
A clone-theoretic formulation of the Erdos-Faber-Lovász conjecture
p. 545