arXiv (All)
open access
The Orbital Bivariate Chromatic Polynomial
We introduce the \emph{orbital bivariate chromatic polynomial}, which counts generalized vertex colorings of a graph up to the action of a group of symmetries. More precisely, adjacent vertices must either receive distinct colors from a set of $λ$ colors or may receive the same color from a distingu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Polynomially Searchable Exponential Neighbourhood for Graph Colouring#824269
- Chromatic symmetric functions for annular webs#1037391
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#652365
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#650912
- Colorful Minors#927142
Record · ID 1356955
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive