Pages that link to "Item:Q2537046"

The following pages link to On Ulam's conjecture for separable graphs (Q2537046):

Displaying 24 items.

• Complexity results in graph reconstruction (Q867853) (← links)
• The double reconstruction conjecture about finite colored hypergraphs (Q912131) (← links)
• The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks (Q1109052) (← links)
• On a new digraph reconstruction conjecture (Q1159216) (← links)
• Proof of Harary's conjecture on the reconstruction of trees (Q1169484) (← links)
• On reconstructing graphs from their sets of subgraphs (Q1229231) (← links)
• The centroidal branches of a separable graph are edge reconstructible (Q1377714) (← links)
• Cospectral graphs and digraphs with given automorphism group (Q1844852) (← links)
• Reconstruction of the set of branches of a graph (Q1911242) (← links)
• The reconstruction of outerplanar graphs (Q2264676) (← links)
• Rigidity and reconstruction for graphs (Q2327716) (← links)
• On a conjecture concerning the reconstruction of graphs (Q2539550) (← links)
• Reconstruction of maximal outerplanar graphs (Q2552507) (← links)
• Reconstructing the degree pair sequence of a digraph (Q2555081) (← links)
• Reconstructing the n-connected components of a graph (Q2558232) (← links)
• Reconstructing the number of blocks of an infinite graph (Q2566150) (← links)
• BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE (Q3166750) (← links)
• ON α,β DESTRUCTIBLE GRAPHS (Q3333080) (← links)
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible (Q3791182) (← links)
• Reconstruction of a Pair of Graphs from their Concatenations (Q3964610) (← links)
• Graph reconstruction—a survey (Q4154892) (← links)
• On the complexity of graph reconstruction (Q4298372) (← links)
• On semi-reconstruction of graphs of connectivity 2 (Q6147865) (← links)
• The degree-associated reconstruction number of an unicentroidal tree (Q6669576) (← links)