Burnside chromatic polynomials of group-invariant graphs

DOI10.7151/DMGT.2385zbMATH Open1504.05144OpenAlexW3115906505MaRDI QIDQ2107741FDOQ2107741

Authors: Jacob A. White 

Publication date: 2 December 2022

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2385

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

zbMATH Keywords

chromatic polynomialgain graphBurnside ringpolynomial function

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• On the notion of balance of a signed graph
• Title not available (Why is that?)
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Acyclic orientations of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Burnside algebra of a finite group
• Voltage graphs
• Maximum frustration in bipartite signed graphs
• Totally frustrated states in the chromatic theory of gain graphs

Cited In (1)

• An elementary chromatic reduction for gain graphs and special hyperplane arrangements

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)