Sommaire

On domination in graphs
p. 7
Graphs with large double domination numbers
p. 13
On double domination in graphs
p. 29
Total domination in categorical products of graphs
p. 35
Planar Ramsey numbers
p. 45
Domination numbers in graphs with removed edge or set of edges
p. 51
Multicolor Ramsey numbers for paths and cycles
p. 57
Maximal hypergraphs with respect to the bounded cost hereditary property
p. 67
Note on the split domination number of the Cartesian product of paths
p. 79
Dominating bipartite subgraphs in graphs
p. 85
Combinatorial lemmas for polyhedrons
p. 95
On (k,l)-kernel perfectness of special classes of digraphs
p. 103
Graph domination in distance two
p. 121
The cycle-complete graph Ramsey number r(C₅,K₇)
p. 129
Two variants of the size Ramsey number
p. 141
Distance coloring of the hexagonal lattice
p. 151
Arithmetically maximal independent sets in infinite graphs
p. 167
Median and quasi-median direct products of graphs
p. 183
Some crossing numbers of products of cycles
p. 197
Note on partitions of planar graphs
p. 211
Estimation of cut-vertices in edge-coloured complete graphs
p. 217
Coloring of G²∖G, for Euclidesian graph G
p. 219
Preface
p. 5