arXiv (All)
open access
On uniquely colorable Cayley graphs
We resolve two open problems regarding uniquely colorable Cayley graphs posed by Klotz and Sander (2017). First, we construct an infinite family of uniquely 3-colorable integral circulant graphs with a clique number of 2. This provides a negative answer to Problem 3.6, which asks whether every uniqu
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
- Large cardinal characterizations via compactness for list colourings#662075
- Large cardinal characterizations via compactness for list colourings#661025
- Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Fourth volume: HyperUncertain Set (Collected Papers)#713414
- Rationality and Quasipolynomiality of Restricted Rectangle Partitions#1071108
- Neutrosophic Lattices#75760
Record · ID 925546
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