BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE (Q3166750)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE	scientific article

Statements

scholarly article

0 references

BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE (English)

0 references

zbMATH Open document ID

0 references

10.1142/S1793830912500395

0 references

0 references

0 references

0 references

Discrete Mathematics, Algorithms and Applications

0 references

publication date

15 October 2012

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

the graph reconstruction conjecture

0 references

bipartite permutation graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

Almost every graph has reconstruction number three

0 references

On Ulam's conjecture for separable graphs

0 references

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

0 references

The reconstruction of outerplanar graphs

0 references

Reconstructing the n-connected components of a graph

0 references

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs

0 references

A congruence theorem for trees

0 references

Reconstructibility and perfect graphs

0 references

full work available at URL

https://doi.org/10.1142/s1793830912500395

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3166750

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3166750&oldid=37214825"