2 citations · 2 across the 1 of their papers we have counts for
1 paper
Vittorio Cipriani, Arno Pauly
We study the complexity of the following related computational tasks concerning a fixed countable graph G: 1. Does a countable graph H provided as input have a(n induced) subgraph…