scientific article; zbMATH DE number 3544095

MaRDI QIDQ4119240zbMATH OpenFDO

Authors Vladimír Müller

Publication date 1976

Full work available at URL https://eudml.org/doc/16787

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(12)

• Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
• 3-regular graphs are 2-reconstructible
• Generalisations of hypomorphisms and reconstruction of hypergraphs
• 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 3 _2n-vertex subgraphs
• Size reconstructibility of graphs
• Minimal asymmetric hypergraphs
• An algorithm to recover shredded random matrices
• Reconstruction of shredded random matrices
• Reconstruction from smaller cards
• Reconstructing random graphs from distance queries

This page was built for publication:

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