Sommaire du Fascicule no. 1

All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5
p. 5
A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs
p. 13
A Note on Neighbor Expanded Sum Distinguishing Index
p. 29
Signed Roman Edgek-Domination in Graphs
p. 39
Decomposition of Certain Complete Bipartite Graphs into Prisms
p. 55
Eternal Domination: Criticality and Reachability
p. 63
On theH-Force Number of Hamiltonian Graphs and Cycle Extendability
p. 79
Structural Properties of Recursively Partitionable Graphs with Connectivity 2
p. 89
Some Results on 4-Transitive Digraphs
p. 117
Almost Self-Complementary 3-Uniform Hypergraphs
p. 131
Rainbow Connection Number of Graphs with Diameter 3
p. 141
Distinguishing Cartesian Products of Countable Graphs
p. 155
The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
p. 165
Criticality of Switching Classes of Reversible 2-Structures Labeled by an Abelian Group
p. 175
Onq-Power Cycles in Cubic Graphs
p. 211
The Dichromatic Number of Infinite Families of Circulant Tournaments
p. 221
Union of Distance Magic Graphs
p. 239
A Constructive Extension of the Characterization on PotentiallyK s , t -Bigraphic Pairs
p. 251
Signed Total Roman Domination in Digraphs
p. 261
Computing the Metric Dimension of a Graph from Primary Subgraphs
p. 273

Sommaire du Fascicule no. 2

Preface
p. 299
Rainbow Connectivity of Cacti and of Some Infinite Digraphs
p. 301
Forbidden Structures for Planar Perfect Consecutively Colourable Graphs
p. 315
How Long Can One Bluff in the Domination Game?
p. 337
WORM Colorings of Planar Graphs
p. 353
Domination Game: Extremal Families for the 3/5-Conjecture for Forests
p. 369
Distance 2-Domination in Prisms of Graphs
p. 383
On the Crossing Numbers of Cartesian Products of Wheels and Trees
p. 399
On Sequential Heuristic Methods for the Maximum Independent Set Problem
p. 415
Interval Incidence Coloring of Subcubic Graphs
p. 427
One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three
p. 443
The Chromatic Number of Random Intersection Graphs
p. 465
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
p. 477

Sommaire du Fascicule no. 3

On the Laplacian Coefficients of Tricyclic Graphs with Prescribed Matching Number
p. 505
C7-Decompositions of the Tensor Product of Complete Graphs
p. 523
A Sufficient Condition for Graphs to Be SuperK-Restricted Edge Connected
p. 537
On Generalized Sierpiński Graphs
p. 547
The Thickness of Amalgamations and Cartesian Product of Graphs
p. 561
Regularity and Planarity of Token Graphs
p. 573
Characterizing Atoms that Result from Decomposition by Clique Separators
p. 587
Construction of Cospectral Integral Regular Graphs
p. 595
Characterization Results for theL(2, 1, 1)-Labeling Problem on Trees
p. 611
On the Maximum and Minimum Sizes of a Graph with Givenk-Connectivity
p. 623
One-Three Join: A Graph Operation and Its Consequences
p. 633
Forbidden Pairs and (k,m)-Pancyclicity
p. 649
Packing Coloring of Some Undirected and Oriented Coronae Graphs
p. 665
Heavy Subgraphs, Stability and Hamiltonicity
p. 691
Kaleidoscopic Colorings of Graphs
p. 711
On the Spectral Characterizations of Graphs
p. 729
A Note on the Locating-Total Domination in Graphs
p. 745
Ramsey Properties of Random Graphs and Folkman Numbers
p. 755
Chromatic Properties of the Pancake Graphs
p. 777
Asymptotic Sharpness of Bounds on Hypertrees
p. 789
A Degree Condition Implying Ore-Type Condition for Even [2,b]-Factors in Graphs
p. 797
Saturation Spectrum of Paths and Stars
p. 811
The Degree-Diameter Problem for Outerplanar Graphs
p. 823
On Double-Star Decomposition of Graphs
p. 835

Sommaire du Fascicule no. 4

Strong Edge-Coloring Of Planar Graphs
p. 845
On The Roman Domination Stable Graphs
p. 859
Prime Factorization And Domination In The Hierarchical Product Of Graphs
p. 873
Constant 2-Labellings And An Application To (R, A, B)-Covering Codes
p. 891
The Total Acquisition Number Of The Randomly Weighted Path
p. 919
Per-Spectral Characterizations Of Some Bipartite Graphs
p. 935
Relating 2-Rainbow Domination To Roman Domination
p. 953
Every 8-Traceable Oriented Graph Is Traceable
p. 963
A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs
p. 975
Twin Minus Total Domination Numbers In Directed Graphs
p. 989
Proper Connection Of Direct Products
p. 1005
Labeled Embedding Of (n, n-2)-Graphs In Their Complements
p. 1015
The Signed Total Roman k-Domatic Number Of A Graph
p. 1027
Signed Total Roman Edge Domination In Graphs
p. 1039
The Existence Of P≥3-Factor Covered Graphs
p. 1055
On H-Irregularity Strength Of Graphs
p. 1067
Equitable Colorings Of Corona Multiproducts Of Graphs
p. 1079