Totally frustrated states in the chromatic theory of gain graphs

DOI10.1016/j.ejc.2008.02.004zbMath1165.05011arXivmath/0609048OpenAlexW1980290964MaRDI QIDQ2519802

Thomas Zaslavsky

Publication date: 27 January 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0609048

zbMATH Keywords

statechromatic polynomialdichromatic polynomialgain graphgain groupstate chromatic functiontotally frustrated stateWhitney number polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Concepts of signed graph coloring, Spectra of quaternion unit gain graphs, Quadratic-monomial generated domains from mixed signed, directed graphs, Burnside chromatic polynomials of group-invariant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biased graphs. I: Bias, balance, and gains
• On geometric semilattices
• Biased graphs. II: The three matroids
• Generating all graph coverings by permutation voltage assignments
• The theory of quality translations with applications to tilings
• A mathematical bibliography of signed and gain graphs and allied areas
• Biased graphs. III: Chromatic and dichromatic invariants
• The Tutte polynomial
• On the Möbius algebra of a partially ordered set
• Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry
• On the notion of balance of a signed graph
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• A Contribution to the Theory of Chromatic Polynomials