Independent transversals of hypergraph edges and bipartite bigraphs

DOI10.1007/BF02733480zbMath0940.05047OpenAlexW2031895874MaRDI QIDQ1974346

Igor Edm. Zverovich

Publication date: 16 July 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02733480

zbMATH Keywords

partitionhypergraphNP-complete problemindependent transversal

Mathematics Subject Classification ID

Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• WELL-COVERED GRAPHS: A SURVEY
• The complexity of theorem-proving procedures
• Unnamed Item

This page was built for publication: Independent transversals of hypergraph edges and bipartite bigraphs