Graphical partially ordered sets (Q1104937)

The main results of this paper can be found in a generalization of reconstruction properties to a large class of combinatorial structures by a concept of g-graph. For example in the section 3, the author shows many results about the reconstruction conjecture: many of them are known for graphs, but author's proof generalizes them for digraphs, hypergraphs, etc... In the concluding section the author lists some open problems.