BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE

DOI10.1142/S1793830912500395zbMath1255.05122OpenAlexW1994679724MaRDI QIDQ3166750

Toshiki Saitoh, Masashi Kiyomi, 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

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

Related Items (2)

Labelled well-quasi-order for permutation classes ⋮ Critical properties of bipartite permutation graphs

Cites Work

• Reconstructibility and perfect graphs
• A congruence theorem for trees
• 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
• The reconstruction of outerplanar graphs
• On Ulam's conjecture for separable graphs
• Reconstructing the n-connected components of a graph
• Almost every graph has reconstruction number three
• Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs

This page was built for publication: BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE