DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
DM
2010
13 years 11 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
DM
2010
13 years 11 months ago
2010
When the standard representation of a crystallographic Coxeter group G (with string diagram) is reduced modulo the integer d 2, one obtains a finite group Gd often the automorphi...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
DM
2010
13 years 11 months ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...