The following pages link to The graph reconstruction number (Q3815338):
Displaying 32 items.
- The forcing vertex detour monophonic number of a graph (Q322058) (← links)
- Degree associated edge reconstruction number of graphs (Q396679) (← links)
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- The adversary degree-associated reconstruction number of double-brooms (Q491632) (← links)
- Degree-associated reconstruction number of graphs (Q709303) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- Largest non-unique subgraphs (Q882786) (← links)
- Reconstruction of \((p, p+1)\)-graphs from elementary contractions (Q1196377) (← links)
- Graph reconstruction -- some new developments (Q1772201) (← links)
- The class reconstruction number of maximal planar graphs (Q1820795) (← links)
- On a reconstruction problem of Harary and Manvel (Q1865368) (← links)
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784) (← links)
- Reconstruction number of graphs with unique pendant vertex (Q2235292) (← links)
- A note on the adversary degree associated reconstruction number of graphs (Q2249937) (← links)
- The size of a graph is reconstructible from any \(n-2\) cards (Q2411612) (← links)
- On the edge-reconstruction number of disconnected graphs (Q2918409) (← links)
- (Q3089201) (← links)
- (Q3374778) (← links)
- (Q3412128) (← links)
- Almost every graph has reconstruction number three (Q3480084) (← links)
- (Q3483308) (← links)
- Class-reconstruction of total graphs (Q3809830) (← links)
- Graphs with arbitrarily large adversary degree associated reconstruction number (Q4956225) (← links)
- Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph (Q5006562) (← links)
- Degree associated edge reconstruction number of split graphs with biregular independent set is one (Q5012380) (← links)
- Adversary degree associated reconstruction number of graphs (Q5245852) (← links)
- (Q5871578) (← links)
- Reconstructing finite sets of points in \(R^n\) up to groups of isometries (Q5952158) (← links)
- Nonsplit Graphs with Split Maximal Induced Subgraphs (Q6154170) (← links)
- Reconstruction from one labelled card and more (Q6536720) (← links)
- An algorithm to recover shredded random matrices (Q6622734) (← links)
- The degree-associated reconstruction number of an unicentroidal tree (Q6669576) (← links)
