Reconstructibility and perfect graphs

DOI10.1016/0012-365X(83)90099-7zbMath0527.05052MaRDI QIDQ595687

Michael von Rimscha

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect graphstriangulated graphssplit graphsinterval graphscomparability graphs

Mathematics Subject Classification ID

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

Related Items (9)

BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE ⋮ Reconstruction of Interval Graphs ⋮ On the complexity of graph reconstruction ⋮ Reconstruction of interval graphs ⋮ Bipartite operator decomposition of graphs and the reconstruction conjecture ⋮ What is reconstruction for ordered sets? ⋮ Reconstructing Cactus Graphs from Shortest Path Information ⋮ Towards the reconstruction of posets ⋮ The reconstruction problem for certain infinite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• The Comparability Graph of a Tree
• Graph reconstruction—a survey
• Computer reconstruction of small graphs
• Transitiv orientierbare Graphen

This page was built for publication: Reconstructibility and perfect graphs