Graph reconstruction -- some new developments
From MaRDI portal
(Redirected from Publication:1772201)
Recommendations
Cited in
(62)- Graph reconstruction from subgraphs
- scientific article; zbMATH DE number 4077274 (Why is no real title available?)
- scientific article; zbMATH DE number 3948325 (Why is no real title available?)
- Decks of rooted binary trees
- scientific article; zbMATH DE number 17789 (Why is no real title available?)
- Bipartite permutation graphs are reconstructible
- Similarity reconstruction of trees
- An algorithm to recover shredded random matrices
- The converse of Kelly's lemma and control-classes in graph reconstruction
- The edge-subgraph poset of a graph and the edge reconstruction conjecture
- Reconstruction number of graphs with unique pendant vertex
- Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
- Reconstructing graphs from a deck of all distinct cards
- Rigidity and reconstruction for graphs
- The reconstruction conjecture and edge ideals
- On switching classes of graphs
- scientific article; zbMATH DE number 7604997 (Why is no real title available?)
- Class-reconstruction of total graphs
- Reconstruction of hypertrees
- scientific article; zbMATH DE number 4063134 (Why is no real title available?)
- Almost every graph has reconstruction number three
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
- Graph reconstruction by permutations
- Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
- Edge reconstruction and the swapping number of a graph
- Disproof of a conjecture in graph reconstruction theory
- An algebraic formulation of the graph reconstruction conjecture
- scientific article; zbMATH DE number 4068923 (Why is no real title available?)
- The vertex and edge graph reconstruction numbers of small graphs
- Complexity results in graph reconstruction
- Balance equations for reconstruction problems
- Finite-type invariants for graphs and graph reconstructions
- Some results and approaches for reconstruction conjectures
- Reconstruction of small graphs and digraphs
- Reconstruction of a graph from 2-vicinities of its vertices
- Reconstituting beta graphs into an efficacious system
- scientific article; zbMATH DE number 5504379 (Why is no real title available?)
- scientific article; zbMATH DE number 1409216 (Why is no real title available?)
- scientific article; zbMATH DE number 4004221 (Why is no real title available?)
- scientific article; zbMATH DE number 4135984 (Why is no real title available?)
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
- scientific article; zbMATH DE number 3912429 (Why is no real title available?)
- A survey of some open questions in reconstruction numbers.
- scientific article; zbMATH DE number 4162922 (Why is no real title available?)
- Some results on the spectral reconstruction problem
- Some work towards the proof of the reconstruction conjecture
- Edge-recognizable domination numbers.
- Reconstruction conjecture-present trends of research
- A note on the vertex-switching reconstruction
- New problems of graph reconstruction
- Reconstruction of pseudographs
- scientific article; zbMATH DE number 4097430 (Why is no real title available?)
- The reconstruction conjecture for finite simple graphs and associated directed graphs
- Reconstruction of Boolean formulas in conjunctive normal form
- A topological variation of the reconstruction conjecture
- A survey on edge reconstruction of graphs
- The reconstruction number of a lexicographic sum of cliques
- On the uniqueness of exact vertex extensions
- Mathematical Foundations of Computer Science 2004
- Switching reconstruction of digraphs
- Switching reconstruction of digraphs
- Progress on the reconstruction conjecture
This page was built for publication: Graph reconstruction -- some new developments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772201)
