Southampton
metadata only
A Polynomially Searchable Exponential Neighbourhood for Graph Colouring
In this paper we develop a new graph colouring strategy. Our heuristic is an example of a so called "polynomially searchable exponential neighbourhood" approach. The neighbourhood is that of permutations of the colours of vertices of a subgraph. Our approach provides a solution method for colouring
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
- Counting List Colorings of Unlabeled Graphs#1014472
- Determining a graph from its reconfiguration graph#927125
- Edge-spectral Turán theorems for color-critical graphs with applications#1123965
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#924484
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#920253
Record · ID 824269
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