Cantor--Bernstein type theorem for locally constrained graph homomorphisms

DOI10.1016/J.EJC.2006.06.003MaRDI QIDQ852701zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Comparing universal covers in polynomial time
• Comparing Universal Covers in Polynomial Time
• Mathematical Foundations of Computer Science 2005
• Locally constrained graph homomorphisms and equitable partitions

Cites work

• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 91031 (Why is no real title available?)
• scientific article; zbMATH DE number 1236360 (Why is no real title available?)
• scientific article; zbMATH DE number 1107736 (Why is no real title available?)
• scientific article; zbMATH DE number 2080268 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3246034 (Why is no real title available?)
• Coverings and minors: Application to local computations in graphs
• Finite common coverings of graphs
• Fixed-parameter complexity of \(\lambda\)-labelings
• Partial covers of graphs
• Role colouring a graph

Cited in

(9)

• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 7651213 (Why is no real title available?)
• Comparing universal covers in polynomial time
• Mixed hypergraphs and other coloring problems
• A Cantor-Bernstein Theorem for Paths in Graphs
• Locally constrained graph homomorphisms and equitable partitions
• Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Subexponential algorithms for variants of the homomorphism problem in string graphs

This page was built for publication: Cantor--Bernstein type theorem for locally constrained graph homomorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852701)