{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T09:27:29Z","timestamp":1700213249740},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s1793830912500395","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T08:31:23Z","timestamp":1344241883000},"page":"1250039","source":"Crossref","is-referenced-by-count":1,"title":["BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE"],"prefix":"10.1142","volume":"04","author":[{"given":"MASASHI","family":"KIYOMI","sequence":"first","affiliation":[{"name":"International College of Arts and Sciences, Yokohama City University, 22-2 Seto, Kanazawa-ku, Yokohama, Kanagawa 236-0027, Japan"}]},{"given":"TOSHIKI","family":"SAITOH","sequence":"additional","affiliation":[{"name":"Department of Electrical and Electronic Engineering, Graduate School of Engineering, Kobe University, 1-1 Rokkodai, Nada, Kobe, 657-8501, Japan"}]},{"given":"RYUHEI","family":"UEHARA","sequence":"additional","affiliation":[{"name":"School of Information Science, JAIST, 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan"}]}],"member":"219","published-online":{"date-parts":[[2012,8,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140102"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1969.31.281"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0085120"},{"key":"rf4","volume-title":"Algorithmic Combinatorics","author":"Even S.","year":"1973"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90066-5"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01838185"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0066431"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103430259"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1957.7.961"},{"key":"rf11","volume-title":"Proof Techniques in Graph Theory","author":"Manvel B.","year":"1969"},{"key":"rf12","first-page":"123","volume":"15","author":"McKay B. D.","journal-title":"Australas. J. Combin."},{"key":"rf14","first-page":"310","volume":"2","author":"Tutte W. T.","journal-title":"J. Combin. Theor."},{"key":"rf15","unstructured":"W. T.\u00a0Tutte, Graph Theory and Related Topics (Academic Press, New York, 1979)\u00a0pp. 15\u201333."},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90099-7"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:43:41Z","timestamp":1565131421000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,6]]},"references-count":14,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,8,6]]},"published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1142\/S1793830912500395"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500395","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,6]]}}}