AbstractGraphs G and H are hypomorphic if there is a bijection φ: V(G) → V(H) such that G − u ≅ H − φ(u), for all u ∈ V(G). The reconstruction conjecture states that hypomorphic graphs are isomorphic, if G has at least three vertices. We investigate properties of the isomorphisms G − u ≅ H − φ(u), and their relation to the reconstructibility of G
AbstractIt is shown that for each positive integer k there are non-isomorphic pendant vertex equival...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
AbstractThis note supplements an earlier paper of this author, in which the concept of a strong k-hy...
Suppose G and G ′ are graphs on the same vertex set V such that for each x ∈ V there is an isomorphi...
AbstractIn this note we shall show that the Graph Reconstruction Conjecture (also called the Kelly-U...
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$...
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$...
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
AbstractA k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the const...
AbstractIt is shown that for each positive integer k there are non-isomorphic pendant vertex equival...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
AbstractThis note supplements an earlier paper of this author, in which the concept of a strong k-hy...
Suppose G and G ′ are graphs on the same vertex set V such that for each x ∈ V there is an isomorphi...
AbstractIn this note we shall show that the Graph Reconstruction Conjecture (also called the Kelly-U...
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$...
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$...
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
AbstractA k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the const...
AbstractIt is shown that for each positive integer k there are non-isomorphic pendant vertex equival...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
DOI
Add to ORKG