Talk:Maximum common induced subgraph
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
The article should make it clear whether 'largest' refers to number of vertices or number of edges. Algebraist 18:24, 27 January 2009 (UTC)
Question should be formulated as follows What is the largest induced subgraph of G1 isomorphic to a induced subgraph of G2? —Preceding unsigned comment added by 193.251.63.39 (talk) 15:17, 19 August 2009 (UTC)
In [Garrey and Johnson], this problem is not expressed using INDUCED subgraphs but using simple subgraphs. It would be nice to give some clarifications whether we speak about induced or simple subgraph.s —Preceding unsigned comment added by 84.102.174.7 (talk) 19:05, 9 February 2010 (UTC)