Combinatorics / CONCEPT

Non-chordal graphs with unstable restricted clique polynomials

For every r ≥ 1, the join of a complete graph on max(r−2,0) vertices with a four-cycle is r-connected, K_{r+3}-free and non-chordal. Marking one cycle vertex gives a clique polynomial with a zero in the product of the upper half-planes.