Reconstructibility and perfect graphs

DOI10.1016/0012-365X(83)90099-7MaRDI QIDQ595687zbMATH OpenFDO

Authors Michael von Rimscha

Publication date 1983

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

interval graphssplit graphsperfect graphscomparability graphstriangulated graphs

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3307330 (Why is no real title available?)
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Computer reconstruction of small graphs
• Graph reconstruction—a survey
• The Comparability Graph of a Tree
• Transitiv orientierbare Graphen

Cited in

(9)

• Reconstruction of Interval Graphs
• On the complexity of graph reconstruction
• Reconstructing cactus graphs from shortest path information (extended abstract)
• What is reconstruction for ordered sets?
• Reconstruction of interval graphs
• Towards the reconstruction of posets
• Bipartite operator decomposition of graphs and the reconstruction conjecture
• Bipartite permutation graphs are reconstructible
• The reconstruction problem for certain infinite graphs

This page was built for publication: Reconstructibility and perfect graphs

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