Ordered sets that are reconstructible from two cards and the number of comparabilities.
From MaRDI portal
(Redirected from Publication:466874)
Recommendations
Cites work
- scientific article; zbMATH DE number 4077274 (Why is no real title available?)
- scientific article; zbMATH DE number 4097430 (Why is no real title available?)
- scientific article; zbMATH DE number 17789 (Why is no real title available?)
- scientific article; zbMATH DE number 1862431 (Why is no real title available?)
- A counterexample about poset reconstruction
- Almost every graph has reconstruction number three
- Constructing graphs with pairs of pseudo-similar vertices
- Examples on ordered set reconstruction
- Graph reconstruction—a survey
- More examples on ordered set reconstruction
- Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
- On ordered sets with isomorphic marked maximal cards
- Pseudo-similar points in ordered sets
- Towards the reconstruction of posets
- What is reconstruction for ordered sets?
Cited in
(11)- Reconstruction of posets with the same comparability graph
- Description of the orders which are hereditarily half-reconstructible by their comparability graphs
- scientific article; zbMATH DE number 4162943 (Why is no real title available?)
- What is reconstruction for ordered sets?
- Finite orders which are reconstructible up to duality by their comparability graphs
- On ordered sets with isomorphic marked maximal cards
- Reconstruction of N-free ordered sets
- Pseudo-similar points in ordered sets
- Disconnected ordered sets are max-reconstructible
- The asymptotic behavior of precise lower estimate of reconstruction of a linear order on a finite set
- More examples on ordered set reconstruction
This page was built for publication: Ordered sets that are reconstructible from two cards and the number of comparabilities.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466874)