Geodesic

Volume 15 (1995) no. 1

Sommaire

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