arXiv (All)
open access
Exact and extremal values of chromatic villainy
Chromatic villainy measures the largest number of vertices that must change color to repair a rearrangement of an optimal coloring while preserving every color multiplicity. Weak villainy allows different multiplicities in the repair. On the odd cycle $C_{2r+1}$, we determine the largest repair dist
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
- Strong edge coloring of graphs with maximum degree $6$#1119018
- On Edge Coloring of Multigraphs#1082904
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound#1119096
Record · ID 1297932
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