Sommaire

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