Deciding hypergraph 2-colourability by H-resolution

Nathan Linial; Michael Tarsi

doi:10.1016/0304-3975(85)90227-0

Deciding hypergraph 2-colourability by H-resolution

Nathan Linial^*, Michael Tarsi

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	343-347
Number of pages	5
Journal	Theoretical Computer Science
Volume	38
Issue number	C
DOIs	https://doi.org/10.1016/0304-3975(85)90227-0
State	Published - 1985

Access to Document

10.1016/0304-3975(85)90227-0

Cite this

@article{70b9e054d7f743afad7bd0479cecfe50,

title = "Deciding hypergraph 2-colourability by H-resolution",

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.",

author = "Nathan Linial and Michael Tarsi",

year = "1985",

doi = "10.1016/0304-3975(85)90227-0",

language = "אנגלית",

volume = "38",

pages = "343--347",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "C",

}

TY - JOUR

T1 - Deciding hypergraph 2-colourability by H-resolution

AU - Linial, Nathan

AU - Tarsi, Michael

PY - 1985

Y1 - 1985

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0021898130&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(85)90227-0

DO - 10.1016/0304-3975(85)90227-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0021898130

SN - 0304-3975

VL - 38

SP - 343

EP - 347

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - C

ER -

Deciding hypergraph 2-colourability by H-resolution

Abstract

Access to Document

Other files and links

Fingerprint

Cite this