{"paper":{"title":"Further Hardness Results on Rainbow and Strong Rainbow Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Juho Lauri","submitted_at":"2014-04-11T11:50:55Z","abstract_excerpt":"A path in an edge-colored graph is \\textit{rainbow} if no two edges of it are colored the same. The graph is said to be \\textit{rainbow connected} if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph is \\textit{strong rainbow connected}. We consider the complexity of the problem of deciding if a given edge-colored graph is rainbow or strong rainbow connected. These problems are called \\textsc{Rainbow connectivity} and \\textsc{Strong rainbow connectivity}, respectively. We prove both problems remain $\\NP$\\hyp{}c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3082","kind":"arxiv","version":4},"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"}