{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7IIKCHZFQW5PVC7HIWXU5K5D6Y","short_pith_number":"pith:7IIKCHZF","schema_version":"1.0","canonical_sha256":"fa10a11f2585bafa8be745af4eaba3f6325b0f4ee0c36c06ce088ecdd0eb937c","source":{"kind":"arxiv","id":"1403.5961","version":6},"attestation_state":"computed","paper":{"title":"Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Carl Feghali, Faisal N. Abu-Khzam, Haiko M\\\"uller","submitted_at":"2014-03-24T14:14:35Z","abstract_excerpt":"A graph $G = (V, E)$ is \\emph{partitionable} if there exists a partition $\\{A, B\\}$ of $V$ such that $A$ induces a disjoint union of cliques and $B$ induces a triangle-free graph. In this paper we investigate the computational complexity of deciding whether a graph is partitionable. The problem is known to be $\\NP$-complete on arbitrary graphs. Here it is proved that if a graph $G$ is bull-free, planar, perfect, $K_4$-free or does not contain certain holes then deciding whether $G$ is partitionable is $\\NP$-complete. This answers an open question posed by Thomass{\\'e}, Trotignon and Vu\\v{s}kov"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1403.5961","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-24T14:14:35Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"21b5cddaeac3d58510effb0bc75847d0e8f9c2fd839f71d64ef4663078f26e38","abstract_canon_sha256":"cab92f0490a7c0e7c149de170a02eecabfee9e07cf842c3eece01ec7deb9aca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.374715Z","signature_b64":"2J1MIb0oxlG9TA1aQlU0gfa5NYT3RIb+H5ROFn/b1c4G4ncLOesutxuj8FNwM5W3L4mmmiQwiOoBYOn2QilFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa10a11f2585bafa8be745af4eaba3f6325b0f4ee0c36c06ce088ecdd0eb937c","last_reissued_at":"2026-05-18T02:30:08.374037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.374037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Carl Feghali, Faisal N. Abu-Khzam, Haiko M\\\"uller","submitted_at":"2014-03-24T14:14:35Z","abstract_excerpt":"A graph $G = (V, E)$ is \\emph{partitionable} if there exists a partition $\\{A, B\\}$ of $V$ such that $A$ induces a disjoint union of cliques and $B$ induces a triangle-free graph. In this paper we investigate the computational complexity of deciding whether a graph is partitionable. The problem is known to be $\\NP$-complete on arbitrary graphs. Here it is proved that if a graph $G$ is bull-free, planar, perfect, $K_4$-free or does not contain certain holes then deciding whether $G$ is partitionable is $\\NP$-complete. This answers an open question posed by Thomass{\\'e}, Trotignon and Vu\\v{s}kov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5961","kind":"arxiv","version":6},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.5961","created_at":"2026-05-18T02:30:08.374144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5961v6","created_at":"2026-05-18T02:30:08.374144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5961","created_at":"2026-05-18T02:30:08.374144+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IIKCHZFQW5P","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IIKCHZFQW5PVC7H","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IIKCHZF","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y","json":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y.json","graph_json":"https://pith.science/api/pith-number/7IIKCHZFQW5PVC7HIWXU5K5D6Y/graph.json","events_json":"https://pith.science/api/pith-number/7IIKCHZFQW5PVC7HIWXU5K5D6Y/events.json","paper":"https://pith.science/paper/7IIKCHZF"},"agent_actions":{"view_html":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y","download_json":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y.json","view_paper":"https://pith.science/paper/7IIKCHZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5961&json=true","fetch_graph":"https://pith.science/api/pith-number/7IIKCHZFQW5PVC7HIWXU5K5D6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7IIKCHZFQW5PVC7HIWXU5K5D6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y/action/storage_attestation","attest_author":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y/action/author_attestation","sign_citation":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y/action/citation_signature","submit_replication":"https://pith.science/pith/7IIKCHZFQW5PVC7HIWXU5K5D6Y/action/replication_record"}},"created_at":"2026-05-18T02:30:08.374144+00:00","updated_at":"2026-05-18T02:30:08.374144+00:00"}