Bipartite Permutation Graphs Are Reconstructible

DOI10.1007/978-3-642-17461-2_29MaRDI QIDQ3066471zbMATHOpenAlexFDO

Authors Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

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)

Recommendations

• Bipartite permutation graphs are reconstructible
• Bipartite permutation graphs
• scientific article; zbMATH DE number 1896992
• Graph reconstruction by permutations
• scientific article; zbMATH DE number 1156661
• Reconstruction Algorithm for Permutation Graphs
• scientific article; zbMATH DE number 4008441
• Biclique graph of bipartite permutation graphs
• scientific article; zbMATH DE number 4063153
• scientific article; zbMATH DE number 2076924

Cited in

(5)

• Bipartite permutation graphs are reconstructible
• scientific article; zbMATH DE number 4008441 (Why is no real title available?)
• Graph reconstruction by permutations
• Reconstruction Algorithm for Permutation Graphs
• Reconstruction of a graph of order \(p\) from its \((p-1)\)-complements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066471)