Abstract
Deciding whether a hypergraph is 2-colourable is a computational problem which contains the satisfiability problem in propositional calculus as a special case. We present a method for deciding the 2-colourability of hypergraphs. This method which we call H-resolution is closely related to resolution of boolean formulas and the relation between the two is investigated.
Original language | English |
---|---|
Pages (from-to) | 343-347 |
Number of pages | 5 |
Journal | Theoretical Computer Science |
Volume | 38 |
Issue number | C |
DOIs | |
State | Published - 1985 |