BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE (Q3166750): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Almost every graph has reconstruction number three
+Normal rank
@@ Property / cites work @@
+On Ulam's conjecture for separable graphs
@@ Property / cites work: On Ulam's conjecture for separable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Microlocal analysis and applications. Lectures given at the 2nd session of the Centro Internazionale Matematico Estivo (C.I.M.E.), held at Montecatini Terme, Italy, July 3-11, 1989
+Normal rank
@@ Property / cites work @@
+The reconstruction of outerplanar graphs
@@ Property / cites work: The reconstruction of outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing the n-connected components of a graph
+Normal rank
@@ Property / cites work @@
+Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
+Normal rank
@@ Property / cites work @@
+A congruence theorem for trees
@@ Property / cites work: A congruence theorem for trees / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructibility and perfect graphs
@@ Property / cites work: Reconstructibility and perfect graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s1793830912500395
+Normal rank
@@ Property / OpenAlex ID @@
+W1994679724
@@ Property / OpenAlex ID: W1994679724 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3166750