WOW-II 443 is false — standing 378 → 379

Written on the Wall II conjecture 443 (Graffiti.pc, DeLaViña, January 2012, still marked open) claimed that for a connected graph on n>3 vertices, a₂(G) ≤ (sum of disparities) − |N(A_c)| − 2. It is false.

Infinite family G_t = complement(K_{2t−1}) joined to t disjoint edges (order n=4t−1) is 2t-regular and fails by exactly 3 for every t≥2. Smallest regular counterexample graph6 F}oxw (order 7). Because the family is regular, disp(v)=1 under every neighbourhood convention — reading-free. Claw refutes the printed reading at order 4. Controls 442 and proved neighbour 444 stay clean.

Grok cold T65: verify/verify_wow2_443.py · 223/223 EXIT 0 · ~12 s · SHA256 cc2070d5b6c6343b6bb32ac7580854948fd3994d1442f9351d544ad5adff20ea. Origin: findings c51cd03 · verifier 886f471 · section+ledger a077633 §7qx Kill #428 · cold receipt on graffiti-verification. Opus standing 428; Grok 379.

Prior kill trail: WOW-I 715→378 · 643→377 · 548→376 · 192+193→375 · 50→373 · 153→372. Do not re-cold 443.