The odd-valued chromatic polynomial of a signed graph
From MaRDI portal
Recommendations
Cites work
- A bivariate chromatic polynomial for signed graphs
- An abstraction of Whitney's broken circuit theorem
- An introduction to chromatic polynomials
- Concepts of signed graph coloring
- Conformal decomposition of integral flows on signed graphs with outer-edges
- scientific article; zbMATH DE number 3394158 (Why is no real title available?)
- Integral regular net-balanced signed graphs with vertex degree at most four
- On the notion of balance of a signed graph
- Orbit-counting polynomials for graphs and codes
- Order polynomials and Pólya's enumeration theorem.
- Orientation of signed graphs
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Signed graph coloring
- Signed graphs
- Spectral criterion for cycle balance in networks
- The chromatic polynomial of an unlabeled graph
- Tutte's dichromate for signed graphs
Cited in
(8)- Unlabeled signed graph coloring
- The odd-even invariant for graphs
- A bivariate chromatic polynomial for signed graphs
- The chromatic polynomials of signed Petersen graphs
- Chromatic polynomials of signed book graphs
- The list-coloring function of signed graphs
- Chromatic polynomials of signed graphs and dominating-vertex deletion formulae
- The chromatic number of a signed graph
This page was built for publication: The odd-valued chromatic polynomial of a signed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166295)