Sommaire

Competition hypergraphs of digraphs with certain properties I. Strong connectedness
p. 5
Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
p. 23
Recognizable colorings of graphs
p. 35
Trees with equal total domination and total restrained domination numbers
p. 59
A classification for maximal nonhamiltonian Burkard-Hammer graphs
p. 67
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles
p. 91
Partitions of a graph into cycles containing a specified linear forest
p. 97
Weakly connected domination subdivision numbers
p. 109
Paths of low weight in planar graphs
p. 121
(H,k) stable graphs with minimum size
p. 137
Maximal k-independent sets in graphs
p. 151
Radio k-labelings for Cartesian products of graphs
p. 165
A cancellation property for the direct product of graphs
p. 179