AbstractA vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v and all edges incident to v. In this paper, we prove that for all graphs on seven or more vertices, the degree sequence can be reconstructed from any (n − 1)-subset of the cards where n is the number of vertices of G
A card (ecard) of a graph G is a subgraph formed by deleting a vertex (an edge). A dacard (da-ecard)...
Proposed in 1942, the Graph Reconstruction Conjecture posits that every simple, finite, undirected g...
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be...
AbstractA vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v...
The deck of a graph G is the multiset of cards. Myrvold (1992) showed that the degree sequence of a ...
A vertex-deleted subgraph (or simply a card) of graph G is an induced subgraph of G containing all ...
AbstractA card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjectu...
10 pagesThe deck of a graph $G$ is the multiset of cards $\{G-v:v\in V(G)\}$. Myrvold (1992) showed ...
AbstractA card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjectu...
AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges...
A graph is {\it reconstructible} if it is determined by its {\it deck} of unlabeled subgraphs obtain...
AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges...
One of the most important open questions in graph theory is the graph reconstruction conjecture, fir...
Abstract. The paper [2] claimed that a disconnected graph with at least two nonisomorphic components...
AbstractWe investigate the relative complexity of the graph isomorphism problem (GI) and problems re...
A card (ecard) of a graph G is a subgraph formed by deleting a vertex (an edge). A dacard (da-ecard)...
Proposed in 1942, the Graph Reconstruction Conjecture posits that every simple, finite, undirected g...
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be...
AbstractA vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v...
The deck of a graph G is the multiset of cards. Myrvold (1992) showed that the degree sequence of a ...
A vertex-deleted subgraph (or simply a card) of graph G is an induced subgraph of G containing all ...
AbstractA card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjectu...
10 pagesThe deck of a graph $G$ is the multiset of cards $\{G-v:v\in V(G)\}$. Myrvold (1992) showed ...
AbstractA card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjectu...
AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges...
A graph is {\it reconstructible} if it is determined by its {\it deck} of unlabeled subgraphs obtain...
AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges...
One of the most important open questions in graph theory is the graph reconstruction conjecture, fir...
Abstract. The paper [2] claimed that a disconnected graph with at least two nonisomorphic components...
AbstractWe investigate the relative complexity of the graph isomorphism problem (GI) and problems re...
A card (ecard) of a graph G is a subgraph formed by deleting a vertex (an edge). A dacard (da-ecard)...
Proposed in 1942, the Graph Reconstruction Conjecture posits that every simple, finite, undirected g...
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be...
DOI
Add to ORKG