Width two posets are reconstructible

DOI10.1016/0012-365X(95)00295-8zbMath0874.06002MaRDI QIDQ1356683

Jean-Xavier Rampon, Dieter Kratsch

Publication date: 5 November 1997

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

zbMATH Keywords

reconstructiondeck of a posetwidth 4width two posets

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Reconstruction of finite truncated semi-modular lattices ⋮ What is reconstruction for ordered sets? ⋮ More examples on ordered set reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A counterexample about poset reconstruction
• Towards the reconstruction of posets
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• On the Structure of Finite T₀ + T₅ Spaces

This page was built for publication: Width two posets are reconstructible