Reconstruction of infinite graphs (Q1191922): Difference between revisions

The paper surveys results concerning reconstruction and edge- reconstructon of infinite graphs and draws attention to several interesting unsolved problems.

0 references

reviewed by

Thomas Andreae

0 references

Mathematics Subject Classification ID

0 references

0 references

reconstruction

0 references

edge-reconstructon

0 references

infinite graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On the reconstruction of locally finite trees

0 references

Note on the reconstruction of infinite graphs with a fixed finite number of components

0 references

Q3955389

0 references

Reconstructing the degree sequence and the number of components of an infinite graph

0 references

Q4187840

0 references

Reconstructing infinite graphs

0 references

Graph reconstruction—a survey

0 references

Reconstructing Graphs

0 references

Q5544087

0 references

Q5652692

0 references

A note on the line reconstruction problem

0 references

Reconstructing the degree pair sequence of a digraph

0 references

The edge reconstruction hypothesis is true for graphs with more than n log n edges

0 references

Bidegreed graphs are edge reconstructible

0 references

Q3870936

0 references

A Glance at Graph Theory-Part II

0 references

Reconstruction of locally finite connected graphs with at least three infinite wings

0 references

Reconstruction of locally finite connected graphs with two infinite wings

0 references

The falsity of the reconstruction conjecture for tournaments

0 references

A census of non-reconstructable digraphs. I: Six related families

0 references

Counterexamples to the Edge Reconstruction Conjecture for infinite graphs

0 references

Reconstructibility versus edge reconstructibility of infinite graphs

0 references

Reconstructing 1-coherent locally finite trees

0 references

full work available at URL

https://doi.org/10.1016/0012-365x(91)90338-3

0 references

OpenAlex ID

W2072255997

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1191922

@@ Property / cites work @@
+On the reconstruction of locally finite trees
@@ Property / cites work: On the reconstruction of locally finite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Note on the reconstruction of infinite graphs with a fixed finite number of components
+Normal rank
@@ Property / cites work @@
+Q3955389
@@ Property / cites work: Q3955389 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing the degree sequence and the number of components of an infinite graph
+Normal rank
@@ Property / cites work @@
+Q4187840
@@ Property / cites work: Q4187840 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing infinite graphs
@@ Property / cites work: Reconstructing infinite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph reconstruction—a survey
@@ Property / cites work: Graph reconstruction—a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing Graphs
@@ Property / cites work: Reconstructing Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5544087
@@ Property / cites work: Q5544087 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5652692
@@ Property / cites work: Q5652692 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the line reconstruction problem
@@ Property / cites work: A note on the line reconstruction problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing the degree pair sequence of a digraph
+Normal rank
@@ Property / cites work @@
+The edge reconstruction hypothesis is true for graphs with more than n log n edges
+Normal rank
@@ Property / cites work @@
+Bidegreed graphs are edge reconstructible
@@ Property / cites work: Bidegreed graphs are edge reconstructible / rank @@
+Normal rank
@@ Property / cites work @@
+Q3870936
@@ Property / cites work: Q3870936 / rank @@
+Normal rank
@@ Property / cites work @@
+A Glance at Graph Theory-Part II
@@ Property / cites work: A Glance at Graph Theory-Part II / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of locally finite connected graphs with at least three infinite wings
+Normal rank
@@ Property / cites work @@
+Reconstruction of locally finite connected graphs with two infinite wings
+Normal rank
@@ Property / cites work @@
+The falsity of the reconstruction conjecture for tournaments
+Normal rank
@@ Property / cites work @@
+A census of non-reconstructable digraphs. I: Six related families
+Normal rank
@@ Property / cites work @@
+Counterexamples to the Edge Reconstruction Conjecture for infinite graphs
+Normal rank
@@ Property / cites work @@
+Reconstructibility versus edge reconstructibility of infinite graphs
+Normal rank
@@ Property / cites work @@
+Reconstructing 1-coherent locally finite trees
@@ Property / cites work: Reconstructing 1-coherent locally finite trees / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(91)90338-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2072255997
@@ Property / OpenAlex ID: W2072255997 / rank @@
+Normal rank