{"entities":{"Q6396539":{"pageid":13529851,"ns":120,"title":"Item:Q6396539","lastrevid":95191187,"modified":"2026-06-05T08:33:49Z","type":"item","id":"Q6396539","labels":{"en":{"language":"en","value":"On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article"}},"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":"Q6396539$FE5B589C-EE4F-40FE-8ED3-E02BD7B68E30","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2c7187f69230ae92b03843a6b1c486efe943955d","datavalue":{"value":{"time":"+2022-04-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6396539$815D7B35-C484-4E14-B274-3CB0B443D4D1","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"994c3ee1f25ee4e3e05037e8d5d9d38d28d0d86b","datavalue":{"value":"2204.07129","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6396539$28EEC840-50BA-4669-AE35-693394834BAF","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q6396539$281BBE6F-81D2-4457-9FEA-AD36033A473A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"beea17b17b8d1b5a9f9834b620089ca44509579a","datavalue":{"value":"cs.CC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6396539$EB798CD0-C8E3-433F-803B-0A1C300309BE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"d9c15d4dc922d1082ff725e5e40ff9c90d3b6ee4","datavalue":{"value":"cs.DM","type":"string"},"datatype":"string"},"type":"statement","id":"Q6396539$D488521E-9650-44A6-84DA-4E1CE1601FB2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q6396539$AB32C499-F507-4267-8D12-A37297B7F726","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9498d26d180aa7c714b9341f1ab5bc5594f30e3c","datavalue":{"value":{"entity-type":"item","numeric-id":2087454,"id":"Q2087454"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6396539$0FACC120-BE05-4416-A8B3-5275DEF3BE32","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1c8bda24e5db7031b811824423dc274be5147149","datavalue":{"value":{"entity-type":"item","numeric-id":170462,"id":"Q170462"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6396539$97FA9EB8-2551-4B85-B4A0-C12EF71ABA2C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4bd60c5bf8b3bdf5a7ccf7d2d3373c4b573c6b1a","datavalue":{"value":{"entity-type":"item","numeric-id":266809,"id":"Q266809"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6396539$7F495440-7075-4FE1-B515-0EC44679B4F5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6396539$E2F71A06-D79B-4098-A6B0-E69B9031B39D","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":"Q6396539$5B9BAFC5-C516-4BCB-8069-FAE04C031897","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b1067a242168583b7b4a7f65b00cbff6005894b4","datavalue":{"value":"10.1016/J.TCS.2022.09.014","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6396539$0BB553BE-DA41-4585-AC49-650D1D3F4752","rank":"normal"}],"P1676":[{"mainsnak":{"snaktype":"value","property":"P1676","hash":"41dcbd78e8288f54da1a9f5432340560159789f4","datavalue":{"value":{"entity-type":"item","numeric-id":2087455,"id":"Q2087455"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6396539$2162506F-D0C7-4D96-8EAC-BAE730126C02","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_The_Complexity_of_Matching_Cut_for_Graphs_of_Bounded_Radius_and_$H$-Free_Graphs"}}}}}