The following pages link to (Q3824449):
Displaying 13 items.
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- Ordered sets that are reconstructible from two cards and the number of comparabilities. (Q466874) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- Reconstruction of distance hereditary 2-connected graphs (Q1637150) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible (Q2283214) (← links)
- Some Kähler structures on products of 2-spheres (Q2314870) (← links)
- A reduction of the graph reconstruction conjecture (Q2509541) (← links)
- Blow-up behavior of a fractional Adams–Moser–Trudinger-type inequality in odd dimension (Q2955370) (← links)
- (Q5000297) (← links)
- (Q5005153) (← links)
- Degree associated edge reconstruction number of split graphs with biregular independent set is one (Q5012380) (← links)
- On boundedness of the generalized<i>B</i>-potential integral operators in the Lorentz spaces (Q5438034) (← links)
