Bipartite permutation graphs are reconstructible

DOI10.1142/S1793830912500395MaRDI QIDQ3166750zbMATH OpenOpenAlexFDO

Authors Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Publication date 15 October 2012

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830912500395

zbMATH Keywords

bipartite permutation graphsthe graph reconstruction conjecture

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)

Recommendations

• Bipartite Permutation Graphs Are Reconstructible
• scientific article; zbMATH DE number 4016946
• Graph reconstruction -- some new developments
• Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
• scientific article; zbMATH DE number 5287238

Cites work

• A congruence theorem for trees
• Almost every graph has reconstruction number three
• Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
• Microlocal analysis and applications. Lectures given at the 2nd session of the Centro Internazionale Matematico Estivo (C.I.M.E.), held at Montecatini Terme, Italy, July 3-11, 1989
• On Ulam's conjecture for separable graphs
• Reconstructibility and perfect graphs
• Reconstructing the n-connected components of a graph
• The reconstruction of outerplanar graphs

Cited in

(5)

• Bipartite Permutation Graphs Are Reconstructible
• Reconstruction Algorithm for Permutation Graphs
• Bipartite operator decomposition of graphs and the reconstruction conjecture
• Labelled well-quasi-order for permutation classes
• Critical properties of bipartite permutation graphs

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 Q3166750)