Cantor--Bernstein type theorem for locally constrained graph homomorphisms

DOI10.1016/j.ejc.2006.06.003zbMath1107.05066OpenAlexW2064788829MaRDI QIDQ852701

Jiří Fiala, Jana Maxová

Publication date: 15 November 2006

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.06.003

zbMATH Keywords

locally bijectivelocally injectivelocally surjective

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Mixed hypergraphs and other coloring problems ⋮ Locally constrained graph homomorphisms and equitable partitions ⋮ Unnamed Item ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Comparing universal covers in polynomial time ⋮ Subexponential algorithms for variants of the homomorphism problem in string graphs ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree

Cites Work

• Finite common coverings of graphs
• Role colouring a graph
• Coverings and minors: Application to local computations in graphs
• Partial covers of graphs
• Fixed-parameter complexity of \(\lambda\)-labelings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item