Stable graphs for a family of endomorphisms

Discrete Mathematics

Volumn 150, Issue 1-3, 1996, Pages 325-335

  Polat, Norbert ^a  

^a UNIVERSITÉ JEAN MOULIN LYON 3   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041629407     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00197-5     Document Type: Article

References (14)

1. M. Chastand and N. Polat, Invariant Hamming graphs in infinite quasi-median graphs, Discrete Math., to appear.
2. M.M. Day, Fixed-point theorems for compact convex sets, Ill. J. Math. 5 (1961) 585-590.
3. R. Halin, Automorphisms and endomorphisms of infinite locally finite graphs, Abh. Math. Sem. Univ. Hamburg 39 (1973) 251-283.
4. S. Kakutani, Two fixed-point theorems concerning bicompact convex sets, Proc. Imp. Acad. Jap. 14 (1938) 242-245.
5. A.A. Markov, Quelques théorèmes sur les ensembles abéliens, C.R. (Doklady) Acad. Sci. URSS (N.S.) 1 (1936) 311-313.
6. R. Nowakowski and I. Rival, Fixed edge theorem for graphs with loops, J. Graph Theory 3 (1979) 339-350.
7. H.M. Mulder, The interval function of a graph, Math. Centre Tracts 132. Mathematisch Centrum, Amsterdam, 1980.
8. N. Polat, Finite invariant sets in infinite graphs, Discrete Math., to appear.
9. N. Polat, Finite invariant simplices in infinite graphs, Period. Math. Hungar 27 (1993) 125-136.
10. N. Polat, Retract-collapsible graphs and invariant subgraph properties, J. Graph Theory 19 (1995) 25-44.
11. N. Polat, A Helly theorem for geodesic convexity is stongly dismantlable graphs. Discrete Math. 140 (1995) 119-127.
12. R. Schmidt, Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhängende Graphen, Arch. Math. 40 (1983) 283-288.
13. C. Tardif, On compact median graphs, preprint, 1993.
14. A. Tarski, A lattice theoretical fixed point theorem and its application, Pacific J. Math. 5 (1995) 285-309.