Graphical partially ordered sets

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

Review text

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.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Graphical partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104937)