{"entities":{"Q6917609":{"pageid":21008134,"ns":120,"title":"Item:Q6917609","lastrevid":75689152,"modified":"2026-04-20T15:50:03Z","type":"item","id":"Q6917609","labels":{"en":{"language":"en","value":"Partitioning a split graph into induced subgraphs that are isomorphic to a path of order 3"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8104669"}},"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":"Q6917609$9CCDF20D-B647-4B02-8DB6-4525070FA060","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"94c8b9e7318ebda456fd075c14ae85bb6faa7b09","datavalue":{"value":{"text":"Partitioning a split graph into induced subgraphs that are isomorphic to a path of order 3","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6917609$552230B1-D6CD-4ADB-8AD0-8433F9C23A26","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f039baf1c801f4e151df9d61ab981b523b6e0655","datavalue":{"value":"10.29235/1561-2430-2019-55-1-32-49","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6917609$0F82F514-D520-467D-A442-B156CFA34A92","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1dde08ccbbf084d5b0ad87039eb08065238dbab1","datavalue":{"value":{"entity-type":"item","numeric-id":1786875,"id":"Q1786875"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6917609$346A001D-44CA-4D15-B7E5-E3EF4EACFF74","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1b56fa8fcf5cb4c44a784a7798ae957799dad258","datavalue":{"value":{"entity-type":"item","numeric-id":6493792,"id":"Q6493792"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6917609$9CD8677D-C82F-4600-9FB2-50DEBAB02EF5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"87e10ecfffd86b359ba2ba30492b483ad15667c5","datavalue":{"value":{"time":"+2025-10-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":"Q6917609$30ED6F42-9EEA-4753-AE52-6F985EFDDB15","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"625e55f1f2a96178239720bc1bbbe7ad21cf0a75","datavalue":{"value":"05C70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6917609$28C49F44-1C4E-4C02-8A5D-578069C09019","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6917609$0E41661E-231A-49AF-9EB0-C83475BA16BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6917609$311C8875-A377-48B6-BE59-20E83BEA02EE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8195a9e26c453276e1d31339bf2413392412013d","datavalue":{"value":"68Q17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6917609$75289EB8-CADA-4B96-B0F6-333E500C4EF9","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"27cd2d1bad9f6c718c75389a5cc7ddebe139d6cd","datavalue":{"value":"8104669","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6917609$C8351BA9-8B5F-420B-9756-F1018B8E2F1E","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2de7707e87a63a255b646d432209290212fda24b","datavalue":{"value":"computational complexity of problems on graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6917609$526B5A18-85FD-47B1-8579-1235283FC3F3","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":"Q6917609$CB235B3B-0EDA-4578-88D5-9D8FC5E22EE5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Partitioning a split graph into induced subgraphs that are isomorphic to a path of order 3","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Partitioning_a_split_graph_into_induced_subgraphs_that_are_isomorphic_to_a_path_of_order_3"}}}}}