Sommaire du Fascicule no. 1

Independent transversal domination in graphs
p. 5
Median of a graph with respect to edges
p. 19
List coloring of complete multipartite graphs
p. 31
On total vertex irregularity strength of graphs
p. 39
Embeddings of hamiltonian paths in faulty k-ary 2-cubes
p. 47
Vertex rainbow colorings of graphs
p. 63
Recognizable colorings of cycles and trees
p. 81
The projective plane crossing number of the circulant graph C(3k;{1,k})
p. 91
Double geodetic number of a graph
p. 109
p-Wiener intervals and p-Wiener free intervals
p. 121
The k-rainbow domatic number of a graph
p. 129
2-distance 4-colorability of planar subcubic graphs with girth at least 22
p. 141
On a generalization of the friendship theorem
p. 153
Characterizing Cartesian fixers and multipliers
p. 161
Parity vertex colorings of binomial trees
p. 177
The first player wins the one-colour triangle avoidance game on 16 vertices
p. 181

Sommaire du Fascicule no. 2

The vertex monophonic number of a graph
p. 191
3-transitive digraphs
p. 205
Disjoint 5-cycles in a graph
p. 221
A characterization of complete tripartite degree-magic graphs
p. 243
The Laplacian spectrum of some digraphs obtained from the wheel
p. 255
Trees with equal 2-domination and 2-independence numbers
p. 263
Edge maximal $C_{2k+1}$-edge disjoint free graphs
p. 271
On kaleidoscopic pseudo-randomness of finite Euclidean graphs
p. 279
1-factors and characterization of reducible faces of plane elementary bipartite graphs
p. 289
Domination in functigraphs
p. 299
The vertex detour hull number of a graph
p. 321
On Ramsey $(K_{1,2}, Kₙ)$-minimal graphs
p. 331
Intersection graph of gamma sets in the total graph
p. 341
Decompositions of a complete multidigraph into almost arbitrary paths
p. 357
Edge cycle extendable graphs
p. 373
Erdös-Ko-Rado from intersecting shadows
p. 379

Sommaire du Fascicule no. 3

Stable sets for $(P₆,K_{2,3})$-free graphs
p. 387
Iterated neighborhood graphs
p. 403
On the total k-domination number of graphs
p. 419
Total vertex irregularity strength of disjoint union of Helm graphs
p. 427
Total domination versus paired domination
p. 435
Fractional distance domination in graphs
p. 449
The total {k}-domatic number of digraphs
p. 461
Paired- and induced paired-domination in {E,net}-free graphs
p. 473
Nowhere-zero modular edge-graceful graphs
p. 487
On composition of signed graphs
p. 507
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
p. 517
On super (a,d)-edge antimagic total labeling of certain families of graphs
p. 535
Light edges in 1-planar graphs with prescribed minimum degree
p. 545
Generalized graph cordiality
p. 557
Generalizations of the tree packing conjecture
p. 569
Generalized matrix graphs and completely independent critical cliques in any dimension
p. 583

Sommaire du Fascicule no. 4

The i-chords of cycles and paths
p. 607
4-chromatic Koester graphs
p. 617
On the total restrained domination number of direct products of graphs
p. 629
Double domination critical and stable graphs upon vertex removal
p. 643
Structural results on maximal k-degenerate graphs
p. 659
On the dominator colorings in trees
p. 677
Minimal trees and monophonic convexity
p. 685
Hamiltonian-colored powers of strong digraphs
p. 705
Minimal rankings of the Cartesian product Kₙ ☐ Kₘ
p. 725
On properties of maximal 1-planar graphs
p. 737
Wiener and vertex PI indices of the strong product of graphs
p. 749
Sharp bounds for the number of matchings in generalized-theta-graphs
p. 771
On the rainbow connection of Cartesian products and their subgraphs
p. 783
The s-packing chromatic number of a graph
p. 795
Convex universal fixers
p. 807