We combinatorially characterize the number \(\textrm{cc}_2\) of conjugacy classes of involutions in any Coxeter group in terms of higher rank odd graphs. This notion naturally generalizes the concept of odd graphs, used previously to count the number of conjugacy classes of reflections. Moreover, we provide formulae for finite and affine types, besides computing \(\textrm{cc}_2\) for all triangle groups and RACGs.
