{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7BICHOH2TNPRYDVQNMMRYTQN4O","short_pith_number":"pith:7BICHOH2","schema_version":"1.0","canonical_sha256":"f85023b8fa9b5f1c0eb06b191c4e0de3aa0e874ee56b80a6c811a8929c0173e2","source":{"kind":"arxiv","id":"1407.1482","version":8},"attestation_state":"computed","paper":{"title":"A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Dani\\\"el Paulusma, Jian Song, Matthew Johnson, Petr A. Golovach","submitted_at":"2014-07-06T11:20:46Z","abstract_excerpt":"For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\\rightarrow\\{1,2,...,k\\}$ such that $c(u)\\neq c(v)$ whenever $uv\\in E$. The Colouring problem is to decide, for a given $G$ and $k$, whether a $k$-colouring of $G$ exists. If $k$ is fixed (that is, it is not part of the input), we have the decision problem $k$-Colouring instead. We survey known results on the computational complexity of Colouring and $k$-Colouring for graph classes that are characterized by one or two forbidden induced subgraphs. We also consider a number of variants: for example, where the prob"},"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":"1407.1482","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-06T11:20:46Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"f869329b9ce16d99b720941e3d6db4f0e5649098e7c8262c3aa1df124a0d9fab","abstract_canon_sha256":"c78611a23aa525530ca04c92a3e6acada21d76c693c58da4de96f529008eb22b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.708211Z","signature_b64":"iacWWjaPFpjPEjyyU2RJ1CgU3RgrmWRhYGbnJ9OnTIyvA9mRiHt/TVweAqR4skF+yUS2hOGhgjEi1pY3X8KADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85023b8fa9b5f1c0eb06b191c4e0de3aa0e874ee56b80a6c811a8929c0173e2","last_reissued_at":"2026-05-18T01:20:50.707816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.707816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Dani\\\"el Paulusma, Jian Song, Matthew Johnson, Petr A. Golovach","submitted_at":"2014-07-06T11:20:46Z","abstract_excerpt":"For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\\rightarrow\\{1,2,...,k\\}$ such that $c(u)\\neq c(v)$ whenever $uv\\in E$. The Colouring problem is to decide, for a given $G$ and $k$, whether a $k$-colouring of $G$ exists. If $k$ is fixed (that is, it is not part of the input), we have the decision problem $k$-Colouring instead. We survey known results on the computational complexity of Colouring and $k$-Colouring for graph classes that are characterized by one or two forbidden induced subgraphs. We also consider a number of variants: for example, where the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1482","kind":"arxiv","version":8},"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":"1407.1482","created_at":"2026-05-18T01:20:50.707881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1482v8","created_at":"2026-05-18T01:20:50.707881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1482","created_at":"2026-05-18T01:20:50.707881+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BICHOH2TNPR","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BICHOH2TNPRYDVQ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BICHOH2","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/7BICHOH2TNPRYDVQNMMRYTQN4O","json":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O.json","graph_json":"https://pith.science/api/pith-number/7BICHOH2TNPRYDVQNMMRYTQN4O/graph.json","events_json":"https://pith.science/api/pith-number/7BICHOH2TNPRYDVQNMMRYTQN4O/events.json","paper":"https://pith.science/paper/7BICHOH2"},"agent_actions":{"view_html":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O","download_json":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O.json","view_paper":"https://pith.science/paper/7BICHOH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1482&json=true","fetch_graph":"https://pith.science/api/pith-number/7BICHOH2TNPRYDVQNMMRYTQN4O/graph.json","fetch_events":"https://pith.science/api/pith-number/7BICHOH2TNPRYDVQNMMRYTQN4O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/action/storage_attestation","attest_author":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/action/author_attestation","sign_citation":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/action/citation_signature","submit_replication":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/action/replication_record"}},"created_at":"2026-05-18T01:20:50.707881+00:00","updated_at":"2026-05-18T01:20:50.707881+00:00"}