Coverings and minors: Application to local computations in graphs

DOI10.1006/eujc.1994.1015zbMath0788.05076OpenAlexW4290983069MaRDI QIDQ1317492

Yves Métivier

Publication date: 21 April 1994

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1994.1015

zbMATH Keywords

coveringrecognitionlocal computationsminor-closed class

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (12)

Distributed enumeration ⋮ Locally computable enumerations ⋮ Cantor--Bernstein type theorem for locally constrained graph homomorphisms ⋮ Leader election in plane cellular automata, only with left-right global convention ⋮ Covering regular graphs ⋮ Graph covers: where topology meets computer science, and simple means difficult ⋮ Computational complexity of covering three-vertex multigraphs ⋮ Complexity of graph covering problems ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Graph Relabelling Systems ⋮ Checking Global Graph Properties by Means of Local Computations: the Majority Problem ⋮ The Kronecker product and local computations in graphs

This page was built for publication: Coverings and minors: Application to local computations in graphs