Deciding hypergraph 2-colourability by H-resolution

DOI10.1016/0304-3975(85)90227-0zbMath0583.05028OpenAlexW2031391696MaRDI QIDQ1069951

Nathan Linial, Michael Tarsi

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90227-0

zbMATH Keywords

hypergraphs2-colourability

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas ⋮ Irreducible disjoint covering systems (with an application to Boolean algebra)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding hypergraph 2-colourability by H-resolution