{"paper":{"title":"k-colored kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernardo Llano, Hortensia Galeana-S\\'anchez, Juan Jos\\'e Montellano-Ballesteros","submitted_at":"2012-01-13T00:18:15Z","abstract_excerpt":"We study $k$-colored kernels in $m$-colored digraphs. An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K$ of its vertices such that\n  (i) from every vertex $v\\notin K$ there exists an at most $k$-colored directed path from $v$ to a vertex of $K$ and\n  (ii) for every $u,v\\in K$ there does not exist an at most $k$-colored directed path between them.\n  In this paper, we prove that for every integer $k\\geq 2$ there exists a $% (k+1)$-colored digraph $D$ without $k$-colored kernel and if every directed cycle of an $m$-colored digraph is monochromatic, then it has a $k$-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2712","kind":"arxiv","version":1},"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"}