{"entities":{"Q7207783":{"pageid":22263302,"ns":120,"title":"Item:Q7207783","lastrevid":107580098,"modified":"2026-10-27T10:52:39Z","type":"item","id":"Q7207783","labels":{"en":{"language":"en","value":"Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7207783$AD0651D5-2B34-48CE-801D-FD9291C287BC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7207783$35B42F15-4FD0-4FE3-8034-6D73BDC7F663","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"a18fe419c90a741c7d929a9b82e347e496040643","datavalue":{"value":"2512.09859","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7207783$EEA8C422-18B9-4893-AD11-045BD93010B5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6a14f01bab44b0458e235562abf9a85319248634","datavalue":{"value":{"entity-type":"item","numeric-id":6852234,"id":"Q6852234"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7207783$3080C741-86D9-4AE9-87F7-D98D93933C6D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"366e1e737930bb3afdbd43d0bd8e0843295b1328","datavalue":{"value":{"entity-type":"item","numeric-id":2108107,"id":"Q2108107"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7207783$81B3B801-BFA8-476C-973E-5721E4A4F457","rank":"normal"},{"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":"Q7207783$468E251F-39E1-4D02-A7CC-0810A704EF7A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4a22dcbf04c0075727c4039eef5cf5f07e568fa3","datavalue":{"value":{"entity-type":"item","numeric-id":259044,"id":"Q259044"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7207783$687E1C2D-AE2A-4634-B04B-CDD6B4925B93","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":"Q7207783$9BE04633-E916-4C4B-ABD9-1A0294B93428","rank":"normal"}],"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":"Q7207783$E1AE6484-ADBA-448E-89F0-1F5EF631C259","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":"Q7207783$8DC0AB5E-5EEC-4485-9C2A-DD0F2D582007","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Colouring_Graphs_Without_a_Subdivided_H-Graph:_A_Full_Complexity_Classification"}}}}}