{"entities":{"Q7255158":{"pageid":24616466,"ns":120,"title":"Item:Q7255158","lastrevid":84854873,"modified":"2026-06-02T14:42:32Z","type":"item","id":"Q7255158","labels":{"en":{"language":"en","value":"A polynomial algorithm for recognizing perfect graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8205467"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7255158$724A41EA-CD4F-47FE-A7F5-FC98FF44A68F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"11637fbe4e596dc6b2cf8f1c8720a48b7250cacf","datavalue":{"value":{"text":"A polynomial algorithm for recognizing perfect graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7255158$9EB57C93-607A-4EF0-AEF7-0B3C2BA80967","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c771d259cdfd6968ef4b79263895aa3ab2e04b13","datavalue":{"value":"10.1109/SFCS.2003.1238177","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7255158$78885574-02A8-4B77-8C02-E773F4DF7DA9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"feb07495fa8de76912d587852b3aa20404b344f1","datavalue":{"value":{"entity-type":"item","numeric-id":163019,"id":"Q163019"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7255158$689FB43D-7B40-4E9F-AF9E-44BF4B896AB0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6cef1d7b1ab63593c601e1906e3247691804c23e","datavalue":{"value":{"entity-type":"item","numeric-id":1405123,"id":"Q1405123"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7255158$A8F1A39C-DB4F-4603-B3AF-02691DD01DDB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"49d526c3d79304181fc7ca4f0d651cb2855460b7","datavalue":{"value":{"entity-type":"item","numeric-id":203962,"id":"Q203962"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7255158$1367AA62-B35C-44B0-ABD7-EBC1D1638EFE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"eed00f8a15e6ee04c7dcccc98e92c47d66129d07","datavalue":{"value":{"time":"+2026-05-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7255158$6B1FE257-496F-4442-A4F7-E38A62D4F2A9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7255158$1B0F6E4A-3F81-4ACC-85F1-0CE524770B67","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"707ef9fb8582c950af90d52346754bf979d1b470","datavalue":{"value":"8205467","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7255158$1172A093-C67A-4832-A01F-DB3097A1FA14","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7255158$DEEEE012-D5B1-47A1-A99B-CEFE71E86333","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A polynomial algorithm for recognizing perfect graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_polynomial_algorithm_for_recognizing_perfect_graphs"}}}}}