arXiv (All)
open access
Density regions, integer certificates and packing colorings of distance graphs
We study simultaneous color densities in packing colorings of integer distance graphs. For $D(1,6)$, we determine several exact density regions and prove that colors $1$ through $7$ have maximum combined density $211/252$. When this maximum is approached, the seven individual color frequencies are f
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 Study of Graph Coloring Heuristics And its Application to a Time Tabling Problem In a Registration and Scheduling System#298652
- Paired Disjunctive Domination Number of Middle Graphs#1012030
- Perspectives on the unit distance problem#997781
- A Note on Triple Repetition Sequence of Domination Number in Graphs#722491
- Results in lattices, ortholattices, and graphs#957961
Record · ID 986629
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