This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Please, think there also about isomorphism classes of graphs. Канеюку ( talk) 16:21, 11 November 2011 (UTC)
The article is a bit vague about what it means for a graph family to be reconstructible. In particular, it should distinguish between weakly reconstructible families (if you know a graph is in the family, you can reconstruct it from its deck), and families which are also recognizable (you can tell from the deck if a graph belongs to the family). A reconstructible family can then be defined as both recognizable and weakly reconstructible. 129.199.99.140 ( talk) 10:03, 31 May 2013 (UTC)
McKay ( talk) 03:33, 18 January 2019 (UTC)
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Please, think there also about isomorphism classes of graphs. Канеюку ( talk) 16:21, 11 November 2011 (UTC)
The article is a bit vague about what it means for a graph family to be reconstructible. In particular, it should distinguish between weakly reconstructible families (if you know a graph is in the family, you can reconstruct it from its deck), and families which are also recognizable (you can tell from the deck if a graph belongs to the family). A reconstructible family can then be defined as both recognizable and weakly reconstructible. 129.199.99.140 ( talk) 10:03, 31 May 2013 (UTC)
McKay ( talk) 03:33, 18 January 2019 (UTC)