arXiv (All)
open access
Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems
In this paper, we characterize finite graphs with circular chromatic number less than 3 in terms of the existence of certain signings ($\mathbb Z_2$-labellings studied in the context of signed graphs). In fact, we construct a signed graph which is universal for all such signings -- called anti-trian
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
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#920253
- Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient#1070654
- On the maximum number of cyclic triples in oriented graphs#490169
- Codegree Thresholds for $λ$-Choosability of Graphs#625299
- Codegree Thresholds for $λ$-Choosability of Graphs#623026
Record · ID 924484
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