{"paper":{"title":"Pseudoachromatic and connected-pseudoachromatic indices of the complete graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Rubio-Montiel, G. Araujo-Pardo","submitted_at":"2015-11-20T21:47:30Z","abstract_excerpt":"A complete $k$-coloring of a graph $G$ is a (not necessarily proper) $k$-coloring of the vertices of $G$, such that each pair of different colors appears in an edge. A complete $k$-coloring is also called connected, if each color class induces a connected subgraph of $G$. The pseudoachromatic index of a graph $G$, denoted by $\\psi'(G)$, is the largest $k$ for which the line graph of $G$ has a complete $k$-coloring. Analogously the connected-pseudoachromatic index of $G$, denoted by $\\psi_c'(G)$, is the largest $k$ for which the line graph of $G$ has a connected and complete $k$-coloring.\n  In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06782","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}