Document Type
Article
Publication Date
1-1-1999
Abstract
Two graphs are minor-equivalent if each is isomorphic to a minor of the other. In this paper, we give structural characterizations of the minor equivalence classes of the infinite full grid GZ×L and of the infinite half-grid GZ×N. A corollary of these results states that every minor of GZ×z that has a minor isomorphic to GZ×N is minor-equivalent to one of GZ×Z or GZ×N. © 1999 Elsevier Science B.V. All rights reserved.
Publication Source (Journal or Book title)
Discrete Mathematics
First Page
203
Last Page
227
Recommended Citation
Oporowski, B. (1999). Minor-equivalence for infinite graphs. Discrete Mathematics, 195 (1-3), 203-227. https://doi.org/10.1016/S0012-365X(98)00126-5
COinS