Reconstruction of posets with the same comparability graph
From MaRDI portal
Recommendations
Cites work
- A congruence theorem for trees
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- scientific article; zbMATH DE number 417290 (Why is no real title available?)
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 3334164 (Why is no real title available?)
- 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
- Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
- The falsity of the reconstruction conjecture for tournaments
- Towards the reconstruction of posets
- Transitiv orientierbare Graphen
Cited in
(15)- A counterexample about poset reconstruction
- Width two posets are reconstructible
- Similarity and dissimilarity in posets
- Reconstruction of finite truncated semi-modular lattices
- What is reconstruction for ordered sets?
- Towards the reconstruction of posets
- Finite orders which are reconstructible up to duality by their comparability graphs
- The idiosyncratic polynomial of digraphs
- Note on transformations of posets with the same upper bound graph and minimal elements
- scientific article; zbMATH DE number 434480 (Why is no real title available?)
- scientific article; zbMATH DE number 458918 (Why is no real title available?)
- The structure and metric dimension of the power graph of a finite group
- On transformations of posets which have the same bound graph
- Prime orders all of whose prime suborders are selfdual
- Green's graphs of a semigroup
This page was built for publication: Reconstruction of posets with the same comparability graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569035)