Abstract
In a graphG, which has a loop at every vertex, a connected subgraphH=(V(H),E(H)) is a retract if, for anya, b ∈V(H) and for any pathsP, Q inG, both joininga tob, and satisfying |Q|≧ ≧|P|, thenP ⫅V(H) wheneverQ ⫅V(H). As such subgraphs can be described by a closure operator we are led to the investigation of the corresponding complete lattice of “closed” subgraphs. For example, in this complete lattice every element is the infimum of an irredundant family of infimum irreducible elements.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Crawley. Decomposition theory for nonsemimodular lattices,Trans. Amer. Math. Soc. 99 (1961), 246–254.
P. Crawley andR. P. Dilworth,Algebraic Theory of Lattices, Prentice-Hall, Englewood Cliffs, N. J., 1973.
P. Hell, Retracts in graphs, Springer-Verlag Lecture Notes in Math.406 (1974), pp. 291–301.
P. Hell, Absolute planar retracts and the Four Colour Conjecture,J. Combin. Theory B,17 (1974), 5–10.
P. Hell, Graph retractions,Atti dei convegni lincei 17 (1976), Vol. II, 263–268.
R. Nowakowski andI. Rival, Fixed-edge theorem for graphs with loops,J. Graph Theory 3 (1979), 339–350.
Author information
Authors and Affiliations
Additional information
The work presented here was supported in part by N.S.E.R.C. Operating Grant No. A4077.