##
**Zentralblatt MATH**

**Publications of (and about) Paul Erdös**

**Zbl.No: ** 751.05070

**Autor: ** Chartrand, Gary; Erdös, Paul; Kubicki, Grzegorz

**Title: ** Absorbing common subgraphs. (In English)

**Source: ** Graph theory, combinatorics, algorithms, and applications, Proc. 2nd Int. Conf., San Francisco/CA (USA) 1989, 96-105 (1991).

**Review: ** [For the entire collection see Zbl 734.00014.]

Authors' abstract: A graph G without isolated vertices is an absorbing common subgraph of two graphs G_{1} and G_{2} of equal size if (1) G is isomorphic to a subgraph of G_{1} and G_{2} and (2) if H is any graph without isolated vertices that is isomorphic to a subgraph of G_{1} and G_{2}, then H is isomorphic to a subgraph of G. Graphs G_{1} and G_{2} are characterized that have an absorbing common subgraph. Several graphs are determined that are absorbing common subgraphs of some pair of graphs or of no pair of graphs.

**Reviewer: ** T.Andreae (Hamburg)

**Classif.: ** * 05C60 Isomorphism problems (graph theory)

**Keywords: ** absorbing common subgraphs

**Citations: ** Zbl 734.00014

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag