{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1835680","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1835680","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1835680","kernelVersion":"v1","immutable":true,"modified":"2025-07-25T02:23:19Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1835680","name":"NP-completeness of a family of graph-colouring problems","headline":"NP-completeness of a family of graph-colouring problems","description":"scientific article; zbMATH DE number 3794097","url":"https://portal.mardi4nfdi.de/entity/Q1835680","datePublished":"1983-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q314432"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96294"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/0166-218X(83)90020-3","url":"https://doi.org/10.1016/0166-218X(83)90020-3"},"sameAs":["https://doi.org/10.1016/0166-218X(83)90020-3"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1255964"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3281090"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4083458"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4198056"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1230637"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1230631"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5554997"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4405185"},{"@id":"https://portal.mardi4nfdi.de/entity/Q755592"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2556423"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1212006"}]},"provenance":{"prov:generatedAtTime":"2025-07-25T02:23:19Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}