Planar character-graphs
From MaRDI portal
Recommendations
Cites work
- 1-Connected character-graphs of finite groups with non-bipartite complement
- K₄-free character graphs with seven vertices
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Bipartite divisor graph for the set of irreducible character degrees
- Bounding the number of vertices in the degree graph of a finite group
- Character degrees of extensions of \(\mathrm{PSL}_2(q)\) and \(\mathrm{SL}_2(q)\).
- Connectedness of degree graphs of nonsolvable groups.
- Degree Graphs of Simple Linear and Unitary Groups
- Finite groups with K₄-free prime graphs.
- Finite groups with \(K_5\)-free prime graphs
- Graph theory
- Groups whose prime graphs have no triangles.
- scientific article; zbMATH DE number 5504628 (Why is no real title available?)
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- Nonsolvable groups with no prime dividing three character degrees.
- On finite simple groups of order divisible by three primes only
- On the character degree graph of finite groups
- On the character degree graph of solvable groups
- On the Number of Components of a Graph Related to Character Degrees
- Solvable groups whose degree graphs have two connected components
Cited in
(2)
This page was built for publication: Planar character-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159810)