On Ulam's conjecture for separable graphs
From MaRDI portal
Publication:2537046
DOI10.2140/pjm.1969.31.281zbMath0187.45603OpenAlexW2115615620WikidataQ56211093 ScholiaQ56211093MaRDI QIDQ2537046
Publication date: 1969
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1969.31.281
Related Items (23)
Reconstruction of a Pair of Graphs from their Concatenations ⋮ BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE ⋮ The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks ⋮ Reconstruction of the set of branches of a graph ⋮ Complexity results in graph reconstruction ⋮ On the complexity of graph reconstruction ⋮ The centroidal branches of a separable graph are edge reconstructible ⋮ On semi-reconstruction of graphs of connectivity 2 ⋮ The double reconstruction conjecture about finite colored hypergraphs ⋮ On a new digraph reconstruction conjecture ⋮ The reconstruction conjecture is true if all 2-connected graphs are reconstructible ⋮ Proof of Harary's conjecture on the reconstruction of trees ⋮ ON α,β DESTRUCTIBLE GRAPHS ⋮ The reconstruction of outerplanar graphs ⋮ On reconstructing graphs from their sets of subgraphs ⋮ Graph reconstruction—a survey ⋮ On a conjecture concerning the reconstruction of graphs ⋮ Reconstruction of maximal outerplanar graphs ⋮ Reconstructing the degree pair sequence of a digraph ⋮ Reconstructing the n-connected components of a graph ⋮ Rigidity and reconstruction for graphs ⋮ Reconstructing the number of blocks of an infinite graph ⋮ Cospectral graphs and digraphs with given automorphism group
This page was built for publication: On Ulam's conjecture for separable graphs
