Geodesic

Sommaire du Fascicule no. 1

The crossing numbers of certain Cartesian products
p. 5-10
Reducible properties of graphs
p. 11-18
On chromaticity of graphs
p. 19-31
Problems remaining NP-complete for sparse or dense graphs
p. 33-41
A note on careful packing of a graph
p. 43-50
The edge domination problem
p. 51-57
Edge-disjoint paths in permutation graphs
p. 59-72
Distinguishing graphs by the number of homomorphisms
p. 73-75
Hamiltonicity in multitriangular graphs
p. 77-88
Some maximum multigraphs and edge/vertex distance colourings
p. 89-106

Sommaire du Fascicule no. 2

Spanning caterpillars with bounded diameter
p. 111-118
Efficient algorithms for minimal disjoint path problems on chordal graphs
p. 119-145
A linear algorithm for the two paths problem on permutation graphs
p. 147-166
Stronger bounds for generalized degrees and Menger path systems
p. 167-177
The flower conjecture in special classes of graphs
p. 179-184
Generalized list colourings of graphs
p. 185-193
On the factorization of reducible properties of graphs into irreducible factors
p. 195-203
Vizing's conjecture and the one-half argument
p. 205-216