The following pages link to (Q4474120):
Displaying 16 items.
- An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- The complexity of locally injective homomorphisms (Q709315) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← 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)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
