Name
Abstract | ||
|---|---|---|
Two graphs G and H are hypomorphic if there exists a bijection φ:V(G)→V(H) such that G−v≅H−φ(v) for each v∈V(G). A graph G is reconstructible if H≅G for all H hypomorphic to G. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jctb.2018.04.007 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Reconstruction conjecture,Reconstruction of locally finite graphs,Extension of partial isomorphisms,Promise structure | Discrete mathematics,Graph,Combinatorics,Finite set,Bijection,Existential quantification,Degree (graph theory),Mathematics,Bounded function | Journal |
Volume | ISSN | Citations |
133 | 0095-8956 | 0 |
PageRank | References | Authors |
0.34 | 3 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathan Bowler | 1 | 16 | 6.83 |
| Joshua Erde | 2 | 4 | 4.93 |
| Peter Christian Heinig | 3 | 4 | 0.88 |
| Florian Lehner | 4 | 21 | 7.24 |
| Max Pitz | 5 | 1 | 4.75 |