Sommaire

On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
p. 207
On •-Line Signed Graphs L•(S)
p. 215
(K − 1)-Kernels In Strong K-Transitive Digraphs
p. 229
A Note on the Total Detection Numbers of Cycles
p. 237
The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic
p. 249
The k-Rainbow Bondage Number of a Digraph
p. 261
On k-Path Pancyclic Graphs
p. 271
Domination, Eternal Domination, and Clique Covering
p. 283
Characterizing which Powers of Hypercubes and Folded Hyper- cubes Are Divisor Graphs
p. 301
Preface
p. 313
Total Domination Multisubdivision Number of a Graph
p. 315
Improved Sufficient Conditions for Hamiltonian Properties
p. 329
Bipartition Polynomials, the Ising Model, and Domination in Graphs
p. 335
Eigenvalue Conditions for Induced Subgraphs
p. 355
Extending the MAX Algorithm for Maximum Independent Set
p. 365
Graphs with 4-Rainbow Index 3 and n − 1
p. 387