scientific article; zbMATH DE number 5762364
From MaRDI portal
Publication:3575763
Cited in
(7)- The hypergraph assignment problem
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries
- scientific article; zbMATH DE number 3910116 (Why is no real title available?)
- scientific article; zbMATH DE number 638367 (Why is no real title available?)
- Achieving new upper bounds for the hypergraph duality problem through logic
- Equivalence of strongly connected graphs and black-and-white 2-SAT problems
- Supersaturated graphs and hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575763)