scientific article; zbMATH DE number 3299378
From MaRDI portal
Publication:5581298
zbMath0187.45601MaRDI QIDQ5581298
Donald L. Greenwell, R. L. Hemminger
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Graphical partially ordered sets ⋮ The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks ⋮ Reconstruction of the set of branches of a graph ⋮ The centroidal branches of a separable graph are edge reconstructible ⋮ On the reconstruction of separable graphs from elementary contractions ⋮ Edge-recognizable domination numbers. ⋮ Reconstructing Graphs ⋮ Reconstructing Graphs ⋮ The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges ⋮ On reconstructing graphs from their sets of subgraphs ⋮ Fixing subgraphs and Ulam's conjecture ⋮ Reconstruction of maximal outerplanar graphs ⋮ A note on the line reconstruction problem ⋮ Reconstructing the degree pair sequence of a digraph ⋮ Bemerkungen zur Ulam-Vermutung
