Boolean conjunctive query evaluation, in combined complexity, is NP-complete in the sense of the NP core: it is definable in existential second-order logic, guessing the valuation, and 3-colorability reduces to it by a quantifier-free first-order reduction, the query of a graph being evaluated in the triangle. This is the evaluation half of Chandra and Merlin (1977).