On a class of isometric subgraphs of a graph

Abstract

In a graphG, which has a loop at every vertex, a connected subgraphH=(V(H),E(H)) is a retract if, for anya, bV(H) and for any pathsP, Q inG, both joininga tob, and satisfying |Q|≧ ≧|P|, thenPV(H) wheneverQV(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, access via your institution.

References

  1. [1]

    P. Crawley. Decomposition theory for nonsemimodular lattices,Trans. Amer. Math. Soc. 99 (1961), 246–254.

    Article  MathSciNet  Google Scholar 

  2. [2]

    P. Crawley andR. P. Dilworth,Algebraic Theory of Lattices, Prentice-Hall, Englewood Cliffs, N. J., 1973.

    Google Scholar 

  3. [3]

    P. Hell, Retracts in graphs, Springer-Verlag Lecture Notes in Math.406 (1974), pp. 291–301.

    MathSciNet  Google Scholar 

  4. [4]

    P. Hell, Absolute planar retracts and the Four Colour Conjecture,J. Combin. Theory B,17 (1974), 5–10.

    MATH  Article  MathSciNet  Google Scholar 

  5. [5]

    P. Hell, Graph retractions,Atti dei convegni lincei 17 (1976), Vol. II, 263–268.

    MathSciNet  Google Scholar 

  6. [6]

    R. Nowakowski andI. Rival, Fixed-edge theorem for graphs with loops,J. Graph Theory 3 (1979), 339–350.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

The work presented here was supported in part by N.S.E.R.C. Operating Grant No. A4077.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Nowakowski, R., Rival, I. On a class of isometric subgraphs of a graph. Combinatorica 2, 79–90 (1982). https://doi.org/10.1007/BF02579284

Download citation

AMS subject classification (1980)

  • 05 C 99
  • 05 C 38
  • 06 A 23