{"@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/Q5229535","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5229535","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q5229535","kernelVersion":"v1","immutable":true,"modified":"2025-05-06T19:25:43Z","fdo:hasComponent":[{"@id":"#fulltext","componentId":"fulltext","mediaType":"application/pdf"}]},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q5229535","name":"Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide","headline":"Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide","description":"scientific article; zbMATH DE number 7094891","url":"https://portal.mardi4nfdi.de/entity/Q5229535","datePublished":"2019-08-15","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5041180"},{"@id":"https://portal.mardi4nfdi.de/entity/Q322306"},{"@id":"https://portal.mardi4nfdi.de/entity/Q309789"},{"@id":"https://portal.mardi4nfdi.de/entity/Q170462"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2725046"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1002/JGT.22431","url":"https://doi.org/10.1002/JGT.22431"},"sameAs":["https://doi.org/10.1002/JGT.22431"]},"provenance":{"prov:generatedAtTime":"2025-05-06T19:25:43Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}