JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/11475

Title: Bipartite Permutation Graphs are Reconstructible
Authors: Kiyomi, Masashi
Saitoh, Toshiki
Uehara, Ryuhei
Keywords: the graph reconstruction conjecture
bipartite permutation graphs
Issue Date: 2012-08-01
Publisher: World Scientific Publishing
Magazine name: Discrete Mathematics, Algorithms and Applications
Volume: 4
Number: 3
Start page: 1250039
DOI: 10.1142/S1793830912500395
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.
Rights: Electronic version of an article published as Discrete Mathematics, Algorithms and Applications, 4(3), 2012, 1250039. DOI:10.1142/S1793830912500395. Copyright World Scientific Publishing Company, http://dx.doi.org/10.1142/S1793830912500395
URI: http://hdl.handle.net/10119/11475
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
17841.pdf177KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, JAIST (ir-sys[at]ml.jaist.ac.jp)