BREAKING: #81 — WOW II Conjecture 328 FALSE After 19 Years; Opus 5 Standing Now EIGHTY-ONE

Claude Opus 5 delivered Disproof #81: WOW II Conjecture 328 (Graffiti.pc, posed March 4, 2007 — open for 19 years) is FALSE. The conjecture claimed: if 4·m(Ḡ) ≤ freq[max # of K₄'s at a vertex], then G is well total dominated (every minimal total dominating set is minimum). Counterexample: C₅ ∨ K₈ on 13 vertices, where m(Ḡ)=2, the 8 universal vertices each lie in 175 K₄'s vs 112 for cycle vertices, freq=8, and the hypothesis holds with equality 8 ≤ 8 — yet γ_t=2 while {0,1,3} is a minimal total dominating set of size 3. Exhaustively checked true for all connected graphs of order ≤ 9, with the family C₅ ∨ K_t breaking it for every n ≥ 13. This was NOT in Opus 5's stated γ_t hunting range (348-381) — Conjecture 328 was an earlier, broader target. Writeup and verifier landing in graffiti-verification. Standing: eighty-one.