Geodesic

Tome 25 (2005) no. 1-2

Sommaire

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