Fiber-complemented graphs II. Retractions and endomorphisms

Discrete Mathematics

Volumn 268, Issue 1-3, 2003, Pages 81-101

  Chastand, Marc ^a  

^a UNIVERSITÉ JEAN MOULIN LYON 3   (France)

Author keywords

Fixed point property; Median graph; Prefiber; Quasi median graph; Retraction

Indexed keywords

EID: 84867975913     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00682-9     Document Type: Article

References (27)

1. H.-J. Bandelt, Retracts of hypercubes, J. Graph Theory 8 (1984) 501-510.
2. H.-J. Bandelt, V. Chepoi, Decomposition and l1-embedding of weakly median graphs, Second International Conference on Discrete Metric Spaces, Lyon, 1996, oral communication.
3. H.-J. Bandelt, J. HedlPQkovPa, Medianalgebras, Discrete Math. 45 (1983) 1-30.
4. H.-J. Bandelt, H.M. Mulder, Regular pseudo-median graphs, J. Graph Theory 12 (1988) 533-549.
5. H.-J. Bandelt, H.M. Mulder, Pseudo-mediangraphs: decompositionvia amalgamationan d Cartesian multiplication, Discrete Math. 94 (1991) 161-180.
6. H.-J. Bandelt, H.M. Mulder, E. Wilkeit, Quasi-median graphs and algebras, J. Graph Theory 18 (1994) 681-703.
7. H.-J. Bandelt, M. vande Vel, A. xed cube theorem for mediangraphs, Discrete Math. 67 (1987) 129-137.
8. M. Chastand, Classes de graphes compacts faiblement modulaires, ThRese de Doctorat, UniversitPe Lyon I, 1997.
9. M. Chastand, Retracts of in.nite Hamming graphs, J. Combin. Theory Ser. B 71 (1997) 54-66.
10. M. Chastand, Fiber complemented graphs-I: structure and invariant subgraphs, Discrete Math. 226 (2001) 107-141.
11. M. Chastand, F. Laviolette, N. Polat, On constructible graphs, in.nite bridged graphs and weakly copwingraphs, Discrete Math. 224 (2000) 61-78.
12. M. Chastand, N. Polat, Invariant Hamming graphs in in.nite quasi-median graphs, Discrete Math. 160 (1996) 93-104.
13. V. Chepoi, Classifying graphs by metric triangles, Metody Diskret. Analiz. 49 (1989) 75-93 (in Russian).
14. V. Chepoi, On distance-reserving and domination elimination orderings, SIAM J. Discrete Math. 11(3) (1998) 414-436.
15. V. Chepoi, Graphs of some CAT(0) complexes, Adv. Appl. Math. 24 (2000) 125-179.
16. M. Farber, Bridged graphs and geodesic convexity, Discrete Math. 66 (1987) 249-257.
17. M. Farber, R.E. Jamison, On local convexity in graphs, Discrete Math. 66 (1987) 231-247.
18. R. Halin, Automorphisms and endomorphisms of locally. nite graphs, Abh. Math. Sem. Univ. Hamburg 39 (1973) 251-283.
19. P. Hell, Graph retractions, Colloq. Intern. Teorie Combinatorie II, Roma, 1976, pp. 263-268.
20. N. Polat, Invariant graphs for a family of endomorphisms-a survey, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, World Scienti.c, Singapore, New Jersey, Hong Kong, 1995, pp. 313-331.
21. N. Polat, Stable graphs for a family of endomorphisms, Discrete Math. 150 (1996) 325-335.
22. I. Rival, The retract construction, in: I. Rival (Ed.), Ordered Sets, Reidel, Dordrecht, 1982, pp. 97-122.
23. C. Tardif, Pre.bers and the Cartesian product of metric spaces, Discrete Math. 109 (1992) 283-288.
24. C. Tardif, Oncompact mediangraphs, J. Graph Theory 23 (1996) 325-336.
25. C. Tardif, A. xed box theorem for the Cartesianproduct of graphs and metric spaces, Discrete Math. 171 (1997) 237-248.
26. J. Tits, Sur le groupe des automorphismes, Essays on topology and related topics, Springer, Berlin, 1970, pp. 188-211.
27. E. Wilkeit, The retracts of Hamming graphs, Discrete Math. 102 (1992) 197-218.