{"entities":{"Q6969490":{"pageid":21320004,"ns":120,"title":"Item:Q6969490","lastrevid":76176681,"modified":"2026-04-23T03:10:41Z","type":"item","id":"Q6969490","labels":{"en":{"language":"en","value":"Bipartite domination in graphs: complexity and algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8054690"}},"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":"Q6969490$E91BE9D5-BB57-4A10-B668-FF7A12C0EC52","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0c12a22252f44ccb1e98eca2637c2394b234e823","datavalue":{"value":{"text":"Bipartite domination in graphs: complexity and algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6969490$038FEA78-8884-4B5E-AE7F-FF95E1D6D6E7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d1040cea34c0dadba73ad17a81fc7fca3c2beca9","datavalue":{"value":"10.1007/978-3-031-83438-7_20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6969490$8A611083-E716-4439-AB2E-8F6959DD32FE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"50060e02bfd7cbcadbeea368613f6e1a1ee23817","datavalue":{"value":{"entity-type":"item","numeric-id":271640,"id":"Q271640"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6969490$7E93E41F-D27C-4FA0-A8A3-94B68FE4A74A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c06c628e6337f33ab96936f1352b881084a69202","datavalue":{"value":{"entity-type":"item","numeric-id":6969489,"id":"Q6969489"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6969490$B78FD0BD-B43B-4440-90AF-B53BAE7E1277","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"09a4060b9490cb12bd9473da146e3a6b9ebe97a5","datavalue":{"value":{"entity-type":"item","numeric-id":779170,"id":"Q779170"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6969490$628AE0B0-FCBC-4B6A-8887-8303F192AB7D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"72aeea3782a02ba4a067f3e6afc76e026ab2747c","datavalue":{"value":{"time":"+2025-06-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6969490$42A0E6A1-30CB-4D4A-80AD-014B0299D0A2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6969490$8C335C37-CDCB-4763-9662-22478C022033","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"159426a5937e62cfbbcc198dd4848ab52d6e715e","datavalue":{"value":"68U05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6969490$22F5A1B6-CD51-42E1-AAD5-A67EE9B5B194","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6969490$A1180699-6F78-47AE-B037-E3AE6E4D04AF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4ebe38a3b5d0dabfe656cf9d5404d80ab433736e","datavalue":{"value":"8054690","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6969490$75E67299-4076-45AB-9132-7F4B274A0D49","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7f607710e1bcd8426818fbf0effed996082aed3f","datavalue":{"value":"domination","type":"string"},"datatype":"string"},"type":"statement","id":"Q6969490$83972FA4-8341-489C-8F7C-18B145FE3EC5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"85ecbecd90b94cf162da3fd69c673c8dd0536b74","datavalue":{"value":"bipartite domination","type":"string"},"datatype":"string"},"type":"statement","id":"Q6969490$AAAA8C4B-280F-4BA6-9D9F-B44D158F53B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bd16e32548a7088f777df5248fcaea221fee7c4d","datavalue":{"value":"block graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6969490$D894800E-E111-4CDC-A60F-0B8CE026D634","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"109ae4e941d7baba4741a008a454bc6b93a67136","datavalue":{"value":"block-cut tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q6969490$6C768E2A-181E-4B94-9405-C07B86019C92","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":"Q6969490$5C3FA497-FCBA-44D7-A933-A43327D06DCD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Bipartite domination in graphs: complexity and algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Bipartite_domination_in_graphs:_complexity_and_algorithms"}}}}}