Graph reconstruction -- some new developments
From MaRDI portal
Publication:1772201
zbMATH Open1067.05050MaRDI QIDQ1772201FDOQ1772201
Authors: Xianqiang Yang 
Publication date: 15 April 2005
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Cited In (62)
- The reconstruction conjecture and edge ideals
- Almost every graph has reconstruction number three
- Title not available (Why is that?)
- On the uniqueness of exact vertex extensions
- Rigidity and reconstruction for graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Switching reconstruction of digraphs
- Switching reconstruction of digraphs
- The converse of Kelly's lemma and control-classes in graph reconstruction
- Reconstruction of small graphs and digraphs
- Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
- A topological variation of the reconstruction conjecture
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
- Some work towards the proof of the reconstruction conjecture
- Edge-recognizable domination numbers.
- Reconstruction number of graphs with unique pendant vertex
- Edge reconstruction and the swapping number of a graph
- Title not available (Why is that?)
- Graph reconstruction from subgraphs
- Class-reconstruction of total graphs
- Title not available (Why is that?)
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
- On switching classes of graphs
- Graph reconstruction by permutations
- An algebraic formulation of the graph reconstruction conjecture
- Reconstruction conjecture-present trends of research
- Title not available (Why is that?)
- Reconstituting beta graphs into an efficacious system
- Title not available (Why is that?)
- The vertex and edge graph reconstruction numbers of small graphs
- Complexity results in graph reconstruction
- An algorithm to recover shredded random matrices
- Some results and approaches for reconstruction conjectures
- Reconstruction of pseudographs
- A survey of some open questions in reconstruction numbers.
- Reconstruction of Boolean formulas in conjunctive normal form
- Title not available (Why is that?)
- Finite-type invariants for graphs and graph reconstructions
- Reconstructing graphs from a deck of all distinct cards
- Title not available (Why is that?)
- Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
- Mathematical Foundations of Computer Science 2004
- Decks of rooted binary trees
- Balance equations for reconstruction problems
- Title not available (Why is that?)
- A note on the vertex-switching reconstruction
- Some results on the spectral reconstruction problem
- Disproof of a conjecture in graph reconstruction theory
- Reconstruction of a graph from 2-vicinities of its vertices
- The edge-subgraph poset of a graph and the edge reconstruction conjecture
- Bipartite permutation graphs are reconstructible
- Progress on the reconstruction conjecture
- Reconstruction of hypertrees
- Similarity reconstruction of trees
- Title not available (Why is that?)
- New problems of graph reconstruction
- The reconstruction number of a lexicographic sum of cliques
- Title not available (Why is that?)
- The reconstruction conjecture for finite simple graphs and associated directed graphs
- A survey on edge reconstruction of graphs
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)
