J. Karhumäki, E. A. Hirsch
2015 Theory of Computing Systems  
study the problem to determine whether a multiset of colors occurs in a connected subgraph of a vertex-colored graph. They prove both negative (inapproximability, NP-completeness) and positive (fixed-parameter tractability) results for several versions of this problem. Dietzfelbinger and Rink investigate the structure of certain random bipartite graphs. They prove the existence of a sequence of probability mass functions that
doi:10.1007/s00224-015-9618-4 fatcat:7dzzt3mqszc77cwd4jdbjz2c64