{"@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/Q2264685","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2264685","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2264685","kernelVersion":"v1","immutable":true,"modified":"2025-11-14T01:50:34Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2264685","name":"A \\(max \\{m, n \\}\\) algorithm for determining the graph H from its line graph G","headline":"A \\(max \\{m, n \\}\\) algorithm for determining the graph H from its line graph G","description":"scientific article; zbMATH DE number 3430704","url":"https://portal.mardi4nfdi.de/entity/Q2264685","datePublished":"1973-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2264684"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q63092"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/0020-0190(73)90029-X","url":"https://doi.org/10.1016/0020-0190(73)90029-X"},"sameAs":["https://doi.org/10.1016/0020-0190(73)90029-X"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5572939"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5514299"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5663889"}]},"provenance":{"prov:generatedAtTime":"2025-11-14T01:50:34Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}