Coverings and minors: application to local computations in graphs
Résumé
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.
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.
Connectez-vous pour contacter le contributeur
https://hal.science/hal-00332773
Soumis le : mardi 21 octobre 2008-16:38:12
Dernière modification le : lundi 26 mai 2025-14:36:02