Non-solvable groups whose character degree graph has a cut-vertex. III (Q6046913)

For a finite group \(G\), the character degree graph of \(G\) is a simple, undirected graph whose vertices correspond to the prime divisors of the numbers in the set \(cd(G)\), representing the irreducible complex characters of \(G\), and two distinct vertices \(p\) and \(q\) are adjacent if and only if \(pq\) divides some number in \(cd(G)\). The graph contains a cut-vertex if the removal of a vertex increases the number of connected components in the graph. The paper under review is the third and final part of a series on non-solvable groups whose character degree graph contains a cut-vertex. In the first paper [Vietnam J. Math. 51, No. 3, 731--753 (2023; Zbl 1522.20032)], the authors establish that these groups possess a unique non-solvable composition factor \(S\), which is a non-abelian simple group. In the second paper [Ann. Mat. Pura Appl. (4) 202, No. 4, 1753--1780 (2023; Zbl 1517.20010)], they explore all isomorphism types for \(S\), except the case \(S = \mathrm{PSL}_2(2^a)\) for some integer \(a \geq 2\). The remaining case is addressed in the paper under review, completing the classification of groups with the cut-vertex property.