Bipartite Permutation Graphs Are Reconstructible

DOI10.1007/978-3-642-17461-2_29zbMATH Open1258.05082OpenAlexW2112450630MaRDI QIDQ3066471FDOQ3066471

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

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

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)

Cited In (5)

• Title not available (Why is that?)
• Reconstruction Algorithm for Permutation Graphs
• Graph reconstruction by permutations
• Bipartite permutation graphs are reconstructible
• 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)