[This corrects the article on p. 68 in vol. 13, PMID: 25912540.].

In this paper, a classification is given for tetravalent graphs of square-free order which are vertex-transitive and edge-transitive. It is shown that such graphs are Cayley graphs, edge-regular metacirculants and covers of some graphs arisen from simple groups A7, J1 and PSL(2, p).

completion elds: A neural model of illusory contour shape and salience. eferences 123 OPR78] R. Ohlander, K. Price, and D. R. Reddy. Picture segmentation using a recursive region splitting method. Sau92] E. Saund. Labeling of curvilinear structure across scales by token grouping. In CVPR, pages 257{263, 1992. SB93] S. Sarkar and K. L. Boyer. Perceptual organization in computer vision: a review ...

Many large graphs can be constructed from existing smaller graphs by using graph operations, for example, the Cartesian product and the lexicographic product. Many properties of such large graphs are closely related to those of the corresponding smaller ones. In this short note, we give some properties of the lexicographic products of vertextransitive and of edge-transitive graphs. In particula...

A factorisation of a complete graph Kn is a partition of its edges with each part corresponding to a spanning subgraph (not necessarily connected), called a factor. A factorisation is called homogeneous if there are subgroups M <G ≤ Sn such that M is vertex-transitive and fixes each factor setwise, and G permutes the factors transitively. We classify the homogeneous factorisations of Kn for whi...

L’actualité de l'article proposé est déterminée par le fait que l'un des aspects importants l'étude la littérature nationale à travers prisme théorie du genre représentation artistique femme en tant sujet création culturelle et porteuse d'un ensemble complexe d'idées culturelles. La nouveauté scientifique recherche présentée réside dans qu'elle tente d'envisager les signes réussite concepts cul...