Deciding hypergraph 2-colourability by H-resolution

Nathan Linial*, Michael Tarsi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

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 languageAmerican English
Pages (from-to)343-347
Number of pages5
JournalTheoretical Computer Science
Volume38
Issue numberC
DOIs
StatePublished - 1985

Fingerprint

Dive into the research topics of 'Deciding hypergraph 2-colourability by H-resolution'. Together they form a unique fingerprint.

Cite this