scientific article
From MaRDI portal
Publication:3824449
zbMath0671.05053MaRDI QIDQ3824449
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (13)
Reconstruction of distance hereditary 2-connected graphs ⋮ Complexity results in graph reconstruction ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ Blow-up behavior of a fractional Adams–Moser–Trudinger-type inequality in odd dimension ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Ordered sets that are reconstructible from two cards and the number of comparabilities. ⋮ On boundedness of the generalizedB-potential integral operators in the Lorentz spaces ⋮ The robustness of LWPP and WPP, with an application to graph reconstruction ⋮ Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible ⋮ A reduction of the graph reconstruction conjecture ⋮ Some Kähler structures on products of 2-spheres ⋮ Degree associated edge reconstruction number of split graphs with biregular independent set is one
This page was built for publication:
