The following pages link to (Q4017175):
Displayed 15 items.
- Computing role assignments of chordal graphs (Q708211) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- Upper bounds and algorithms for parallel knock-out numbers (Q1008728) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- Covering regular graphs (Q1386472) (← links)
- Algorithm for recognizing Cartesian graph bundles (Q1613382) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- (Q2777507) (← links)
- Complexity of Locally Injective Homomorphism to the Theta Graphs (Q3000520) (← links)
- Locally Injective Homomorphism to the Simple Weight Graphs (Q3010426) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)