Abstract
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture has been verified for all graphs with at most 11 vertices. Further, the conjecture has been verified for regular graphs, trees, disconnected graphs, unit interval graphs, separable graphs with no pendant vertex, outer-planar graphs, and unicyclic graphs. We extend the list of graph classes for which the conjecture holds. We give a proof that bipartite permutation graphs are reconstructible. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Kiyomi, M., Saitoh, T., & Uehara, R. (2010). Bipartite permutation graphs are reconstructible. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6509 LNCS, pp. 362–373). https://doi.org/10.1007/978-3-642-17461-2_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
