Deciding hypergraph 2-colourability by H-resolution (Q1069951)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deciding hypergraph 2-colourability by H-resolution |
scientific article; zbMATH DE number 3933102
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding hypergraph 2-colourability by H-resolution |
scientific article; zbMATH DE number 3933102 |
Statements
Deciding hypergraph 2-colourability by H-resolution (English)
0 references
1985
0 references
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.
0 references
2-colourability
0 references
hypergraphs
0 references
