Pages that link to "Item:Q1772201"
From MaRDI portal
The following pages link to Graph reconstruction -- some new developments (Q1772201):
Displaying 37 items.
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph (Q282748) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs (Q868330) (← links)
- Vertex-switching reconstruction of subgraph numbers and triangle-free graphs (Q909676) (← links)
- Reconstruction of a graph from 2-vicinities of its vertices (Q947081) (← links)
- The reconstruction conjecture and edge ideals (Q952662) (← links)
- Similarity reconstruction of trees (Q1062078) (← links)
- Reconstruction of hypertrees (Q1065031) (← links)
- Balance equations for reconstruction problems (Q1076692) (← links)
- A note on the vertex-switching reconstruction (Q1114710) (← links)
- Disproof of a conjecture in graph reconstruction theory (Q1200285) (← links)
- Reconstituting beta graphs into an efficacious system (Q1306167) (← links)
- Some results and approaches for reconstruction conjectures (Q1313839) (← links)
- More on vertex-switching reconstruction (Q1322006) (← links)
- Some work towards the proof of the reconstruction conjecture (Q1412674) (← links)
- Edge-recognizable domination numbers. (Q1415542) (← links)
- On switching classes of graphs (Q1747120) (← links)
- Reconstruction of Boolean formulas in conjunctive normal form (Q1791022) (← links)
- Finite-type invariants for graphs and graph reconstructions (Q1881101) (← links)
- On the weak reconstruction of Cartesian-product graphs (Q1916107) (← links)
- The reconstruction conjecture for finite simple graphs and associated directed graphs (Q2138987) (← links)
- Reconstruction number of graphs with unique pendant vertex (Q2235292) (← links)
- Rigidity and reconstruction for graphs (Q2327716) (← links)
- Some results on the spectral reconstruction problem (Q2383024) (← links)
- An algebraic formulation of the graph reconstruction conjecture (Q2800593) (← links)
- Edge reconstruction and the swapping number of a graph (Q2875477) (← links)
- Almost every graph has reconstruction number three (Q3480084) (← links)
- (Q3597417) (← links)
- Class-reconstruction of total graphs (Q3809830) (← links)
- A graph reconstructor's manual (Q3975132) (← links)
- Reconstruction of graphs with certain degree-sequences (Q4838482) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311105) (← links)
- Switching Reconstruction of Digraphs (Q5495887) (← links)
- Graph reconstruction from subgraphs (Q5937946) (← links)
- Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs (Q6151923) (← links)
- An algorithm to recover shredded random matrices (Q6622734) (← links)
- Decks of rooted binary trees (Q6655698) (← links)