Comments on: If a family of forbidden subgraphs is hard, does that imply that the graph class is hard?

Comments on: If a family of forbidden subgraphs is hard, does that imply that the graph class is hard? http://cstheory.blogoverflow.com/2011/08/if-a-family-of-forbidden-subgraphs-is-hard-does-that-imply-that-the-graph-class-is-hard/ The Theoretical Computer Science Stack Exchange Blog Fri, 18 Mar 2016 21:21:18 +0000 hourly 1 https://wordpress.org/?v=4.5.6