Sommaire du Fascicule no. 1

Strongly pancyclic and dual-pancyclic graphs
p. 5
Variable neighborhood search for extremal graphs. 17. Further conjectures and results about the index
p. 15
k-Kernels and some operations in digraphs
p. 39
Convex independence and the structure of clone-free multipartite tournaments
p. 51
Restrained domination in unicyclic graphs
p. 71
Decompositions of quadrangle-free planar graphs
p. 87
Kernels and cycles' subdivisions in arc-colored tournaments
p. 101
Equitable coloring of Kneser graphs
p. 119
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
p. 143
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
p. 163
Quasiperfect domination in triangular lattices
p. 179
A note on k-uniform self-complementary hypergraphs of given order
p. 199

Sommaire du Fascicule no. 2

Multicolor Ramsey numbers for some paths and cycles
p. 209
Acyclic reducible bounds for outerplanar graphs
p. 219
On infinite uniquely partitionable graphs and graph properties of finite character
p. 241
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
p. 253
Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties
p. 263
On odd and semi-odd linear partitions of cubic graphs
p. 275
On normal partitions in cubic graphs
p. 293
Directed hypergraphs: a tool for researching digraphs and hypergraphs
p. 313
Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs
p. 337
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments
p. 349
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
p. 361
On 𝓕-independence in graphs
p. 377
On local structure of 1-planar graphs of minimum degree 5 and girth 4
p. 385
On universal graphs for hom-properties
p. 401
On k-intersection edge colourings
p. 411
Preface
p. 207

Sommaire du Fascicule no. 3

On transitive orientations of G-ê
p. 423
Independent transversals of longest paths in locally semicomplete and locally transitive digraphs
p. 469
On Lee's conjecture and some results
p. 481
The list linear arboricity of planar graphs
p. 499
Minimum congestion spanning trees of grids and discrete toruses
p. 511
Colouring vertices of plane graphs under restrictions given by faces
p. 521
The set chromatic number of a graph
p. 545
Decompositions of nearly complete digraphs into t isomorphic parts
p. 563
(H,k) stable bipartite graphs with minimum size
p. 573
Potentially H-bigraphic sequences
p. 583
Bounds on the global offensive k-alliance number in graphs
p. 597
Relations between the domination parameters and the chromatic index of a graph
p. 615
Forbidden-minor characterization for the class of graphic element splitting matroids
p. 629
Pairs of forbidden class of subgraphs concerning $K_{1,3}$ and P₆ to have a cycle containing specified vertices
p. 645
Packing of nonuniform hypergraphs - product and sum of sizes conditions
p. 651