The following pages link to Juho Lauri (Q266283):
Displaying 18 items.
- On finding rainbow and colorful paths (Q266284) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- Upper bounding rainbow connection number by forest number (Q2138952) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
- (Q4560246) (← links)
- On the Fine-Grained Complexity of Rainbow Coloring (Q4606330) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- (Q5140739) (← links)
- Engineering Motif Search for Large Graphs (Q5232527) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
- Complexity of fall coloring for restricted graph classes (Q5918283) (← links)
- Complexity of fall coloring for restricted graph classes (Q5919476) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5920155) (← links)
