547 search results - page 93 / 110 » dm 2008 |
DM
2008
15 years 3 months ago
2008
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
DM
2008
15 years 3 months ago
2008
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
DM
2008
15 years 3 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
111
click to vote
DM
2008
15 years 3 months ago
2008
A pooling space is a ranked poset P such that the subposet w+ induced by the elements above w is atomic for each element w of P. Pooling spaces were introduced in [Discrete Mathem...
114
click to vote
DM
2008
15 years 3 months ago
2008
The present paper continues the study (begun by Quattrocchi, Colouring 4-cycle systems with specified block colour pattern: the case of embedding P3-designs, Electron. J. Combin.,...