The odd-valued chromatic polynomial of a signed graph

DOI10.1016/j.disc.2022.113042zbMath1495.05106OpenAlexW4282958832MaRDI QIDQ2166295

Xiangyu Ren, Sumin Huang, Junxia Zhang, Jian Guo Qian

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113042

zbMATH Keywords

bivariate chromatic polynomialZaslavsky's chromatic polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items

The list-coloring function of signed graphs

Cites Work

• Unnamed Item
• Order polynomials and Pólya's enumeration theorem.
• An abstraction of Whitney's broken circuit theorem
• A bivariate chromatic polynomial for signed graphs
• The chromatic polynomial of an unlabeled graph
• Signed graphs
• Signed graph coloring
• Orientation of signed graphs
• Conformal decomposition of integral flows on signed graphs with outer-edges
• Tutte's dichromate for signed graphs
• Concepts of signed graph coloring
• Orbit-counting polynomials for graphs and codes
• On the notion of balance of a signed graph
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Spectral criterion for cycle balance in networks
• Integral regular net-balanced signed graphs with vertex degree at most four
• An introduction to chromatic polynomials