1 citations · 1 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021★ 1 cited
GraphSAT -- a decision problem connecting satisfiability and graph theory
Vaibhav Karve, Anil N. Hirani
Satisfiability of boolean formulae (SAT) has been a topic of research in logic and computer science for a long time. In this paper we are interested in understanding the structure…
math.CO2018
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs
Vaibhav Karve, Anil N. Hirani
A propositional logic sentence in conjunctive normal form that has clauses of length two (a 2-CNF) can be associated with a multigraph in which the vertices correspond to the varia…