Browse by Staff
 | Up a level |
Group by: Item Type | No Grouping
Number of items: 3.
Brown, Paul and Fenner, Trevor (2017) The size of a graph is reconstructible from any n - 2 cards. Discrete Mathematics 341 (1), pp. 165-174. ISSN 0012-365X.
Bowler, Andrew and Brown, Paul and Fenner, Trevor and Myrvold, W. (2010) Recognizing connectedness from vertex-deleted subgraphs. Journal of Graph Theory 67 (4), pp. 285-299. ISSN 0364-9024.
Bowler, Andrew and Brown, Paul and Fenner, Trevor (2010) Families of pairs of graphs with a large number of common cards. Journal of Graph Theory 63 (2), pp. 146-163. ISSN 0364-9024.