Geodesic
Absolute Retracts and Varieties of Reflexive Graphs
Canadian journal of mathematics, Tome 39 (1987) no. 3, pp. 544-567

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

For a graph G, let V(G) denote its vertex set and E(G) its edge set. Here we shall only consider reflexive graphs, that is graphs in which every vertex is adjacent to itself. These adjacencies, i.e., the loops, will not be depicted in the figures, although we always assume them present. For graphs G and H, an edge-preserving map (or homomorphism) of G to H is a mapping of V(G) to V(H) such that f(g) is adjacent to f(g′) in H whenever g is adjacent to g′ in G. Because our graphs are reflexive, an edge-preserving map can identify adjacent vertices, i.e., possibly f(g) = f(g′) for some g adjacent to g′, cf. Figure 1(a). 
Hell, Pavol; Rival, Ivan. Absolute Retracts and Varieties of Reflexive Graphs. Canadian journal of mathematics, Tome 39 (1987) no. 3, pp. 544-567. doi: 10.4153/CJM-1987-025-1
@article{10_4153_CJM_1987_025_1,
     author = {Hell, Pavol and Rival, Ivan},
     title = {Absolute {Retracts} and {Varieties} of {Reflexive} {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {544--567},
     year = {1987},
     volume = {39},
     number = {3},
     doi = {10.4153/CJM-1987-025-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1987-025-1/}
}
TY  - JOUR
AU  - Hell, Pavol
AU  - Rival, Ivan
TI  - Absolute Retracts and Varieties of Reflexive Graphs
JO  - Canadian journal of mathematics
PY  - 1987
SP  - 544
EP  - 567
VL  - 39
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1987-025-1/
DO  - 10.4153/CJM-1987-025-1
ID  - 10_4153_CJM_1987_025_1
ER  - 
%0 Journal Article
%A Hell, Pavol
%A Rival, Ivan
%T Absolute Retracts and Varieties of Reflexive Graphs
%J Canadian journal of mathematics
%D 1987
%P 544-567
%V 39
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1987-025-1/
%R 10.4153/CJM-1987-025-1
%F 10_4153_CJM_1987_025_1

[1] 1. Berge, C., Graphs and hyper graphs (North Holland, Amsterdam, London, 1973). Google Scholar

[2] 2. Borsuk, K., Sur les rétractes, Fundamenta Math. 17 (1931), 152–170. Google Scholar

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

[4] 4. Hell, P., Rétractions de graphes, Ph.D. thesis, Université de Montréal (1972). Google Scholar

[5] 5. Hell, P., Absolute retracts in graphs in Graphs and combinatorics, Springer-Verlag, Lect. Notes Math. 406 (1973), 291–301. Google Scholar | DOI

[6] 6. Hell, P., Graph retractions, Atti dei convegni lincei 17 (1976), 263–268. Google Scholar

[7] 7. Jawhari, E. M., Pouzet, M. and Rival, I., A classification of reflexive graphs: the use of “holes”, Can. J. Math. 38 (1986), 1299–1328. Google Scholar

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

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

[10] 10. Pesch, E., Absolute Retrakte von Graphen, Diplomarbeit, Technische Hochschule Darmstadt (1982). Google Scholar

[11] 11. Pesch, E. and Poguntke, W., A characterization of absolute retracts of n-chromatic graphs, Discrete Math. 57 (1985), 99–104. Google Scholar

[12] 12. Quilliot, A., Homomorphismes, points fixes, rétractions et jeux de poursuite dans les graphes, let ensembles ordonnées et les espaces métriques, Thèse d'Etat, Université de Paris VI (1983). Google Scholar

[13] 13. Quilliot, A., An application of the Helly property to the partially ordered sets, J. Combin. Theory A 35 (1983), 185–198. Google Scholar

[14] 14. Rosenfeld, M., On a problem of C. E. Shannon in graph theory, Proc. Amer. Math. Soc. 18 (1967), 315–319. Google Scholar

[15] 15. Rosenfeld, M., Sabidussi, Personal communication (1970). Google Scholar

Cité par Sources :