Burnside chromatic polynomials of group-invariant graphs
From MaRDI portal
Publication:2107741
Recommendations
- Chromatic invariants for finite graphs: Theme and polynomial variations
- An elementary chromatic reduction for gain graphs and special hyperplane arrangements
- Galois groups of chromatic polynomials
- Chromatic polynomials and the symmetric group
- Chromatic polynomials and representations of the symmetric group
Cites work
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Acyclic orientations of graphs
- Maximum frustration in bipartite signed graphs
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- On the notion of balance of a signed graph
- The Burnside algebra of a finite group
- Totally frustrated states in the chromatic theory of gain graphs
- Voltage graphs
This page was built for publication: Burnside chromatic polynomials of group-invariant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107741)