arXiv (All)
open access
Embedding equitable (s,p)-edge-colorings of $K_n$
An $(s,p)$-edge-coloring of a graph $G$ is an edge coloring using $s$ colors such that exactly $p$ colors appear at each vertex. To generalize the notion of proper edge-coloring, these colorings are defined to be equitable: the numbers of edges of each color incident to a vertex are fairly distribut
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
- The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive#821633
- Defective chromatic polynomials#1118544
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#799562
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#798139
Record · ID 1216921
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