Bivariate chromatic polynomials of mixed graphs

DOI10.46298/DMTCS.9595MaRDI QIDQ6599786zbMATH OpenFDO

Authors Matthias Beck, Sampada Kolhatkar

Publication date 6 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license arXiv.org Non-exclusive license to distribute

Full work available at URL https://doi.org/10.46298/DMTCS.9595

zbMATH Keywords

acyclic orientationbivariate chromatic polynomialbivariate order polynomialcombinatorial reciprocity theoremmixed graphorder preserving mapposet

Mathematics Subject Classification ID

Graph polynomials (05C31)

Recommendations

• Bivariate order polynomials
• A bivariate chromatic polynomial for signed graphs
• On weak chromatic polynomials of mixed graphs
• Bivariate chromatic polynomials in computer algebra
• An extension of the bivariate chromatic polynomial

Cites work

• A Most General Edge Elimination Polynomial
• Gelfand-Tsetlin polytopes and Feigin-Fourier-Littelmann-Vinberg polytopes as marked poset polytopes

This page was built for publication: Bivariate chromatic polynomials of mixed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599786)