Geodesic
A Classification of Reflexive Graphs: The use of “Holes”
Canadian journal of mathematics, Tome 38 (1986) no. 6, pp. 1299-1328

Voir la notice de l'article provenant de la source Cambridge University Press

The purpose of this article is to develop aspects of a classification theory for reflexive graphs. A first important step was already taken in [2]; throughout we follow, at least the spirit, of the classification theory for ordered sets initiated in [1].For a graph G let V(G) denote its vertex set and E(G) ⊆ V(G) × V(G) its edge set. A graph K is a subgraph of G if V(K) ⊆ V(G) and for a, b ∊ V(K), (a, b) ∊ E(K) just if (a, b) ∊ E(G). The subgraph K of G is a retract of G, and we write K ◅ G, if there is an edge-preserving map g of V(G) to V(K) satisfying g(v) = v for each v ∊ V(K); g is called a retraction. A reflexive graph is an undirected graph with a loop at every vertex. The reason for a loop at a vertex is that an edge-preserving map can send the two vertices of an adjacent pair to it. The concept is illustrated in Figure 1. From here on, though, we shall for convenience suppress the illustration of the loops in the figures of reflexive graphs. 
Jawhari, El Moustafa; Pouzet, Maurice; Rival, Ivan. A Classification of Reflexive Graphs: The use of “Holes”. Canadian journal of mathematics, Tome 38 (1986) no. 6, pp. 1299-1328. doi: 10.4153/CJM-1986-066-9
@article{10_4153_CJM_1986_066_9,
     author = {Jawhari, El Moustafa and Pouzet, Maurice and Rival, Ivan},
     title = {A {Classification} of {Reflexive} {Graphs:} {The} use of {{\textquotedblleft}Holes{\textquotedblright}}},
     journal = {Canadian journal of mathematics},
     pages = {1299--1328},
     year = {1986},
     volume = {38},
     number = {6},
     doi = {10.4153/CJM-1986-066-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1986-066-9/}
}
TY  - JOUR
AU  - Jawhari, El Moustafa
AU  - Pouzet, Maurice
AU  - Rival, Ivan
TI  - A Classification of Reflexive Graphs: The use of “Holes”
JO  - Canadian journal of mathematics
PY  - 1986
SP  - 1299
EP  - 1328
VL  - 38
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1986-066-9/
DO  - 10.4153/CJM-1986-066-9
ID  - 10_4153_CJM_1986_066_9
ER  - 
%0 Journal Article
%A Jawhari, El Moustafa
%A Pouzet, Maurice
%A Rival, Ivan
%T A Classification of Reflexive Graphs: The use of “Holes”
%J Canadian journal of mathematics
%D 1986
%P 1299-1328
%V 38
%N 6
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1986-066-9/
%R 10.4153/CJM-1986-066-9
%F 10_4153_CJM_1986_066_9

[1] 1. Duffus, D. and Rival, I., A structure theory for ordered sets, Discrete Math. 35 (1981), 53–118. Google Scholar

[2] 2. Nowakowski, R. J. and Rival, I., A fixed edge theorem for graphs with loops, J. Graph Theory 3 (1979), 339–350. Google Scholar

[3] 3. Nowakowski, R. J. and Rival, I., The smallest graph variety containing all paths, Discrete Math. 43 (1983), 223–234. Google Scholar

Cité par Sources :