The following pages link to (Q4373685):
Displayed 13 items.
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- Computational complexity of covering disconnected multigraphs (Q2140489) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Complexity of Locally Injective Homomorphism to the Theta Graphs (Q3000520) (← links)
- Locally Injective Homomorphism to the Simple Weight Graphs (Q3010426) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
- Graph covers: where topology meets computer science, and simple means difficult (Q6070783) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)