Courcelle, Bruno; Métivier, Yves Coverings and minors: Application to local computations in graphs. (English) Zbl 0788.05076 Eur. J. Comb. 15, No. 2, 127-138 (1994). Summary: Using the notion of covering, we prove that a minor-closed class of graphs cannot be recognized by local computations, except in a few special cases. Cited in 11 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) Keywords:recognition; covering; minor-closed class; local computations PDFBibTeX XMLCite \textit{B. Courcelle} and \textit{Y. Métivier}, Eur. J. Comb. 15, No. 2, 127--138 (1994; Zbl 0788.05076) Full Text: DOI