Pages that link to "Item:Q2550035"
From MaRDI portal
The following pages link to A simpler counterexample to the reconstruction conjecture for denumerable graphs (Q2550035):
Displayed 8 items.
- Can colour-blind distinguish colour palettes? (Q396838) (← links)
- Reconstructing the degree sequence and the number of components of an infinite graph (Q1147163) (← links)
- Graph theoretic models (Q1148340) (← links)
- Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs (Q1168334) (← links)
- Counterexamples to the Edge Reconstruction Conjecture for infinite graphs (Q1257028) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- Reconstructing the number of blocks of an infinite graph (Q2566150) (← links)
- (Q4046065) (← links)