Bipartite Permutation Graphs Are Reconstructible

DOI10.1007/978-3-642-17461-2_29zbMath1258.05082OpenAlexW2112450630MaRDI QIDQ3066471

Masashi Kiyomi, Ryuhei Uehara, Toshiki Saitoh

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_29

zbMATH Keywords

graph reconstruction conjecturebipartite permutation graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Bipartite Permutation Graphs Are Reconstructible