AbstractThis note supplements an earlier paper of this author, in which the concept of a strong k-hypomorphism between two graphs was defined (Thatte, 1990, Sectin VI). For k=1, this is just a hypomorphism. Here it is proved that strongly k-hypomorphic graphs and strongly k-edge hypomorphic directed graphs are isomorphic if k>1
AbstractA k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the const...
AbstractA probably very difficult question of Nash-Williams asks whether any two hypomorphic trees a...
AbstractA probably very difficult question of Nash-Williams asks whether any two hypomorphic trees a...
AbstractGraphs G and H are hypomorphic if there is a bijection φ: V(G) → V(H) such that G − u ≅ H − ...
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 ...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
Suppose G and G ′ are graphs on the same vertex set V such that for each x ∈ V there is an isomorphi...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
AbstractIn this note we shall show that the Graph Reconstruction Conjecture (also called the Kelly-U...
AbstractIt is shown that for each positive integer k there are non-isomorphic pendant vertex equival...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractA k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the const...
AbstractA probably very difficult question of Nash-Williams asks whether any two hypomorphic trees a...
AbstractA probably very difficult question of Nash-Williams asks whether any two hypomorphic trees a...
AbstractGraphs G and H are hypomorphic if there is a bijection φ: V(G) → V(H) such that G − u ≅ H − ...
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 ...
13International audienceLet $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and ...
Suppose G and G ′ are graphs on the same vertex set V such that for each x ∈ V there is an isomorphi...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
AbstractIn this note we shall show that the Graph Reconstruction Conjecture (also called the Kelly-U...
AbstractIt is shown that for each positive integer k there are non-isomorphic pendant vertex equival...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractA k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the const...
AbstractA probably very difficult question of Nash-Williams asks whether any two hypomorphic trees a...
AbstractA probably very difficult question of Nash-Williams asks whether any two hypomorphic trees a...
DOI
Add to ORKG