×

Coverings and minors: Application to local computations in graphs. (English) Zbl 0788.05076

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.

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.)
PDFBibTeX XMLCite
Full Text: DOI