{"entities":{"Q6440235":{"pageid":13573247,"ns":120,"title":"Item:Q6440235","lastrevid":95243018,"modified":"2026-06-05T08:40:58Z","type":"item","id":"Q6440235","labels":{"en":{"language":"en","value":"Partitioning graphs with linear minimum degree"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900596014"}},"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":"Q6440235$87AADA13-8371-4BC0-963E-78B6B49F0F86","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"eea7a550f980bf0ce22e37e9b1c0b5e403fd09f5","datavalue":{"value":{"time":"+2023-06-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6440235$EAE83FF5-975B-4B08-86C5-F51B5DBA93CD","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f03237021485388147fae5314e853af88a68b7d5","datavalue":{"value":{"entity-type":"item","numeric-id":232421,"id":"Q232421"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6440235$3AE71F72-C68F-4F25-B269-71A0DE452C4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b05fcd1f84ea2b157ca9b69d27f100638c5f4bef","datavalue":{"value":{"entity-type":"item","numeric-id":322347,"id":"Q322347"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6440235$A1B7D3B2-465F-4D68-8746-44E901E80190","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"90336180d0fa1a30c8135c722eeec67da561ca24","datavalue":{"value":"900596014","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6440235$E5FDF0ED-74F9-44A7-8BD4-FEB0FCB759D9","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":"Q6440235$EF703A69-A05D-408A-8137-141DD2F1DDD9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Partitioning graphs with linear minimum degree","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Partitioning_graphs_with_linear_minimum_degree"}}}}}