arXiv (All)
open access
Counting List Colorings of Unlabeled Graphs
The classic enumerative functions for counting colorings of a graph $G$, such as the chromatic polynomial $P(G,k)$, do so under the assumption that the given graph is labeled. In 1985, Hanlon defined and studied the chromatic polynomial for an unlabeled graph $\mathcal{G}$, $P(\mathcal{G}, k)$. Dete
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
- Determining a graph from its reconfiguration graph#927125
- Graph Theory and Additive Combinatorics#67364
- Complexity, approximation, and extension of proper $\{a,b\}$-edge-weightings#1105763
- Cayley Tournaments Simultaneously Critical for the Clique and Dichromatic Numbers#985991
Record · ID 1014472
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