scientific article; zbMATH DE number 3674136
From MaRDI portal
Publication:3870936
Cited in
(27)- On the edge reconstruction of locally finite disconnected graphs with a finite number of components
- Hypomorphisms, orbits, and reconstruction
- Combinatorial reconstruction problems
- A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
- Constructing trees with given eigenvalues and angles
- Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
- Reconstruction of infinite graphs
- Fractional isomorphism of graphs
- Unique representability and matroid reconstruction
- What is reconstruction for ordered sets?
- Finite-type invariants for graphs and graph reconstructions
- A larger class of reconstructible tournaments
- The robustness of LWPP and WPP, with an application to graph reconstruction
- Reconstructing the degree sequence of a sparse graph from a partial deck
- Reconstruction number of graphs with unique pendant vertex
- A reduction of the graph reconstruction conjecture
- Population recovery and partial identification
- Tough graphs and Hamiltonian circuits.
- Reconstructing the number of blocks of an infinite graph
- A note on non-reconstructible 3-hypergraphs
- The robustness of LWPP and WPP, with an application to graph reconstruction
- Degree associated edge reconstruction number of split graphs with biregular independent set is one
- Shotgun reconstruction in the hypercube
- On the expressibility of the reconstructional color refinement
- Complexity results in graph reconstruction
- Reconstructing degree sequences from k-vertex-deleted subgraphs
- Switching reconstruction and diophantine equations
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 Q3870936)
