Abstract
Given two finite posetsPandP′ with the same comparability graph, we show that if V(P)≥4 and if for allx∈V(P),P-x≃P′-x, thenP≃P′. This result leads us to characterize the finite posetsPsuch that for allx∈V(P),P-x≃P*-x. © 1998 Academic Press.
Author supplied keywords
Cite
CITATION STYLE
APA
Ille, P., & Rampon, J. X. (1998). Reconstruction of Posets with the Same Comparability Graph. Journal of Combinatorial Theory. Series B, 74(2), 368–377. https://doi.org/10.1006/jctb.1998.1859
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free