A bivariate chromatic polynomial for signed graphs

DOI10.1007/s00373-014-1481-6zbMath1327.05099arXiv1204.2568OpenAlexW1991911469MaRDI QIDQ497310

Matthias Beck, Mela Hardin

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

acyclic orientationsigned graphdeletion-contractioninside-out polytopebivariate chromatic polynomialcombinatorial reciprocitygraphic arrangement

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Coloring of graphs and hypergraphs (05C15) Lattice points in specified regions (11P21) Signed and weighted graphs (05C22)

Related Items (2)

The odd-valued chromatic polynomial of a signed graph ⋮ Bivariate order polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extension of the bivariate chromatic polynomial
• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• Signed graph coloring
• Orientation of signed graphs
• A mathematical bibliography of signed and gain graphs and allied areas
• Inside-out polytopes
• Acyclic orientations of graphs
• Fibonacci Identities and Graph Colorings
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Computing the Continuous Discretely

This page was built for publication: A bivariate chromatic polynomial for signed graphs