scientific article; zbMATH DE number 3544095
From MaRDI portal
Publication:4119240
zbMath0349.05121MaRDI QIDQ4119240
Publication date: 1976
Full work available at URL: https://eudml.org/doc/16787
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Generalisations of hypomorphisms and reconstruction of hypergraphs ⋮ Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices ⋮ Size reconstructibility of graphs ⋮ Minimal asymmetric hypergraphs ⋮ 3-regular graphs are 2-reconstructible ⋮ The adversary degree-associated reconstruction number of double-brooms ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs
This page was built for publication:
