Sommaire du Fascicule no. 1

Paired domination in prisms of graphs
p. 5
Notes on the independence number in the Cartesian product of graphs
p. 25
Decomposition tree and indecomposable coverings
p. 37
Radio numbers for generalized prism graphs
p. 45
Cyclically k-partite digraphs and k-kernels
p. 63
A magical approach to some labeling conjectures
p. 79
The independent domination number of a random graph
p. 129
Closure for spanning trees and distant area
p. 143
Coloring rectangular blocks in 3-space
p. 161
Weak roman domination in graphs
p. 161
The forcing steiner number of a graph
p. 171
Parity vertex colouring of graphs
p. 183
A characterization of locating-total domination edge critical graphs
p. 197

Sommaire du Fascicule no. 2

Preface
p. 207
Generalized total colorings of graphs
p. 209
Color-bounded hypergraphs, V: host graphs and subdivisions
p. 223
On the crossing numbers of G □ Cₙ for graphs G on six vertices
p. 239
On Fulkerson conjecture
p. 253
Kernels by monochromatic paths and the color-class digraph
p. 273
Monochromatic cycles and monochromatic paths in arc-colored digraphs
p. 283
k-kernels in generalizations of transitive digraphs
p. 293
Graphs with rainbow connection number two
p. 313
The crossing numbers of join products of paths with graphs of order four
p. 321
On doubly light vertices in plane graphs
p. 333
Generalized circular colouring of graphs
p. 345
Interval edge colorings of some products of graphs
p. 357
Graphs with equal domination and 2-distance domination numbers
p. 375
Bounds for the rainbow connection number of graphs
p. 387
Distance independence in graphs
p. 397

Sommaire du Fascicule no. 3

Signed domination and signed domatic numbers of digraphs
p. 415
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
p. 429
Defective choosability of graphs in surfaces
p. 441
The connected forcing connected vertex detour number of a graph
p. 461
Bounding neighbor-connectivity of Abelian Cayley graphs
p. 475
The hull number of strong product graphs
p. 493
An inductive proof of Whitney's Broken Circuit Theorem
p. 509
γ-graphs of graphs
p. 517
Closed k-stop distance in graphs
p. 533
Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle
p. 547
Unique factorization theorem for object-systems
p. 559
Simplicial and nonsimplicial complete subgraphs
p. 577
On the strong parity chromatic number
p. 587
Forbidden-minor characterization for the class of cographic element splitting matroids
p. 601

Sommaire du Fascicule no. 4

On the forcing geodetic and forcing steiner numbers of a graph
p. 611
Some results on semi-total signed graphs
p. 625
Complete minors, independent sets, and chordal graphs
p. 639
Oriented colouring of some graph products
p. 675
Characterization of trees with equal 2-domination number and domination number plus two
p. 687
Connected global offensive k-alliances in graphs
p. 699
Upper bounds on the b-chromatic number and results for restricted graph classes
p. 709
Wiener index of the tensor product of a path and a cycle
p. 737
Spanning tree congestion of rook's graphs
p. 753
Roman bondage in graphs
p. 763
Planar graphs without 4-, 5- and 8-cycles are 3-colorable
p. 775
On monochromatic paths and bicolored subdigraphs in arc-colored tournaments
p. 791