A Kuratowski-type approach for [2,3]-graphs, i.e., hypergraphs whose edges have cardinality not more than 3, is presented, leading to a well-quasi-order in such a context, with a complete obstruction set of six forbidden hypergraphs to plane embedding.
