arXiv (All)
open access
Quandle coloring quivers of pretzel links
In this paper, we conduct a systematic study of quandle colorings and quandle coloring quivers for pretzel links using the dihedral quandle $\mathbb{Z}_{n}$. First, we systematically investigate all possible colorings of 3-pretzel links, determining the number of distinct colorings in each case as w
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 note on the multicolor size-Ramsey numbers of connected graphs#128283
- Greedy-Like Defective Coloring: Distributed Algorithms and Applications#423920
- Sequence b-colorings in graphs#985835
- Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds#819369
- Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds#809376
Record · ID 1077056
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