On Ulam's conjecture for separable graphs

DOI10.2140/PJM.1969.31.281MaRDI QIDQ2537046zbMATH OpenOpenAlexWikidataFDO

Authors J. A. Bondy

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

zbMATH Keywords

topology

Cited in

(25)

• The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
• On a new digraph reconstruction conjecture
• Proof of Harary's conjecture on the reconstruction of trees
• On reconstructing graphs from their sets of subgraphs
• The centroidal branches of a separable graph are edge reconstructible
• Cospectral graphs and digraphs with given automorphism group
• Reconstruction of the set of branches of a graph
• The reconstruction of outerplanar graphs
• Rigidity and reconstruction for graphs
• 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
• Reconstructing the number of blocks of an infinite graph
• Bipartite permutation graphs are reconstructible
• ON α,β DESTRUCTIBLE GRAPHS
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• Reconstruction of a Pair of Graphs from their Concatenations
• Graph reconstruction—a survey
• On the complexity of graph reconstruction
• On semi-reconstruction of graphs of connectivity 2
• The degree-associated reconstruction number of an unicentroidal tree
• Recognizing trees from incomplete decks
• Complexity results in graph reconstruction
• The double reconstruction conjecture about finite colored hypergraphs

This page was built for publication: On Ulam's conjecture for separable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2537046)