Sommaire

4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
p. 247
Independent Detour Transversals in 3-Deficient Digraphs
p. 261
Exact Expectation and Variance of Minimal Basis of Random Matroids
p. 277
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m n)
p. 289
On the Rainbow Vertex-Connection
p. 307
The Incidence Chromatic Number of Toroidal Grids
p. 315
Frucht’s Theorem for the Digraph Factorial
p. 329
Strong Equality Between the Roman Domination and Independent Roman Domination Numbers in Trees
p. 337
The Balanced Decomposition Number of TK4 and Series-Parallel Graphs
p. 347
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
p. 361
Star Coloring of Subcubic Graphs
p. 373
On the Domination of Cartesian Product of Directed Cycles: Results for Certain Equivalence Classes of Lengths
p. 387
A Characterization of Trees for a New Lower Bound on the K-Independence Number
p. 395
On Closed Modular Colorings of Trees
p. 411
Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs
p. 429
Edge Dominating Sets and Vertex Covers
p. 437
Two Short Proofs on Total Domination
p. 457
A Tight Bound on the Set Chromatic Number
p. 461
The Path-Distance-Width of Hypercubes
p. 467