69 search results - page 11 / 14 » ejc 2008 |
143
Voted
EJC
2008
15 years 3 months ago
2008
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
136
click to vote
EJC
2008
15 years 2 months ago
2008
Let be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of . This paper aims to characterize (, G) under the conditions that the quotient gr...
136
click to vote
EJC
2008
15 years 5 months ago
2008
In this paper we briefly describe a new conceptual model for XML called XSEM. It is a combination of several approaches in the area. It divides the conceptual modeling process to c...
122
click to vote
EJC
2008
15 years 3 months ago
2008
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
157
click to vote
EJC
2008
15 years 3 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...