{"paper":{"title":"On Chromatic Core Subgraph of Simple Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, M. Jerlin Seles, Sudev Naduvath, U. Mary","submitted_at":"2018-03-05T05:48:00Z","abstract_excerpt":"If distinct colours represent distinct technology types that are placed at the vertices of a simple graph in accordance to a minimum proper colouring, a disaster recovery strategy could rely on an answer to the question: \"What is the maximum destruction, if any, the graph (a network) can undergo while ensuring that at least one of each technology type remain, in accordance to a minimum proper colouring of the remaining induced subgraph.\" In this paper, we introduce the notion of a chromatic core subgraph $H$ of a given simple graph $G$ in answer to the stated problem. Since for any subgraph $H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01505","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"}