Cantor--Bernstein type theorem for locally constrained graph homomorphisms
DOI10.1016/J.EJC.2006.06.003zbMATH Open1107.05066OpenAlexW2064788829MaRDI QIDQ852701FDOQ852701
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Role colouring a graph
- Coverings and minors: Application to local computations in graphs
- Title not available (Why is that?)
- Fixed-parameter complexity of \(\lambda\)-labelings
- Title not available (Why is that?)
- Finite common coverings of graphs
- Title not available (Why is that?)
- Partial covers of graphs
- Title not available (Why is that?)
Cited In (9)
- A Cantor-Bernstein Theorem for Paths in Graphs
- Subexponential algorithms for variants of the homomorphism problem in string graphs
- Comparing universal covers in polynomial time
- Mixed hypergraphs and other coloring problems
- Locally constrained graph homomorphisms and equitable partitions
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Mathematical Foundations of Computer Science 2005
- Title not available (Why is that?)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
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)
