Reconstruction of posets with the same comparability graph

DOI10.1006/jctb.1998.1859zbMath1026.05085OpenAlexW2006661183MaRDI QIDQ1569035

Jean-Xavier Rampon, Pierre Ille

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1859

Mathematics Subject Classification ID

Partial orders, general (06A06) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

The idiosyncratic polynomial of digraphs ⋮ Prime orders all of whose prime suborders are selfdual ⋮ Reconstruction of finite truncated semi-modular lattices ⋮ The structure and metric dimension of the power graph of a finite group ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ What is reconstruction for ordered sets?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Towards the reconstruction of posets
• The falsity of the reconstruction conjecture for tournaments
• L'Indeformabilite des Relations et Multirelations Binaires
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• Transitiv orientierbare Graphen

This page was built for publication: Reconstruction of posets with the same comparability graph