COMPLEXITY OF COVER-PRESERVING EMBEDDINGS OF BIPARTITE ORDERS INTO BOOLEAN LATTICES

DOI10.4467/20842589RM.14.006.2276zbMath1355.06006OpenAlexW1912066678MaRDI QIDQ5499652

Grzegorz Herman

Publication date: 30 July 2015

Full work available at URL: https://dblp.uni-trier.de/db/journals/rml/rml49.html#Herman14

zbMATH Keywords

Boolean latticeNP-completenessembeddabilitybipartite orderscover-preserving embeddings

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Structure theory of lattices (06B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: COMPLEXITY OF COVER-PRESERVING EMBEDDINGS OF BIPARTITE ORDERS INTO BOOLEAN LATTICES