BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE-Reference-Cited by-同舟云学术

BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE

Published:2012-08-06 Issue:03 Volume:04 Page:1250039
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

KIYOMI MASASHI¹,SAITOH TOSHIKI²,UEHARA RYUHEI³

Affiliation:

1. International College of Arts and Sciences, Yokohama City University, 22-2 Seto, Kanazawa-ku, Yokohama, Kanagawa 236-0027, Japan

2. Department of Electrical and Electronic Engineering, Graduate School of Engineering, Kobe University, 1-1 Rokkodai, Nada, Kobe, 657-8501, Japan

3. School of Information Science, JAIST, 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830912500395

Reference14 articles.

1. Almost every graph has reconstruction number three

2. On Ulam’s conjecture for separable graphs

3. Microlocal Analysis and Applications

4. The reconstruction of outerplanar graphs

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Critical properties of bipartite permutation graphs;Journal of Graph Theory;2023-08