Graphs determined by their finite induced subgraphs

https://doi.org/10.1016/0095-8956(86)90046-8Get rights and content
Under an Elsevier user license
open archive

Abstract

A classification is given of those countable graphs which are determined up to isomorphism by the set of their finite induced subgraphs.

Cited by (0)

Present address: New Hall, Cambridge CB3 0DF, England.