{"entities":{"Q2816030":{"pageid":2826768,"ns":120,"title":"Item:Q2816030","lastrevid":42168684,"modified":"2025-05-26T21:59:06Z","type":"item","id":"Q2816030","labels":{"en":{"language":"en","value":"The complexity of the chromatic sum problem on cubic planar graphs and regular graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6600220"}},"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":"Q2816030$8CC4ECBB-7C75-4129-A296-1B179584167C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"59066ea74b8b707b7d3b5c5ac44c9a38b80f4d1e","datavalue":{"value":"1409.05068","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816030$7A8127DB-76F7-4220-AF84-28E30FA3FB2B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"681fa36f324bfdb5f85fc6878945cb77d35a0028","datavalue":{"value":{"entity-type":"item","numeric-id":237430,"id":"Q237430"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2816030$81CF718C-CDC5-4872-9CB9-D877F2BCD9AD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"229745c739398706b499dd2ab4ef9fd94f7cbced","datavalue":{"value":{"time":"+2016-07-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2816030$9D1F1F13-2C9C-47F9-A626-4B969A258E4C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"75ae500f37c1cd1f40ef892df7a2062ba6d4391f","datavalue":{"value":"http://www.sciencedirect.com/science/article/pii/S1571065305800800?np=y","type":"string"},"datatype":"url"},"type":"statement","id":"Q2816030$6272A795-FFAC-4448-825D-0DA114D9E983","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"357c7c34a1a90d83243f17011b7aa90788d1792d","datavalue":{"value":"05C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816030$CDBB83EC-92BB-455C-8719-FBAE02874605","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f15d46cb8d4ffe0dbd9357e013b784d0f700114","datavalue":{"value":"05C15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816030$779C6E43-2FA2-41FD-AE5B-856EBCA358E1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5d8d8f38351af923fd792959f6571a45544d97a8","datavalue":{"value":"6600220","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816030$E16773C5-CBFF-496B-B1E0-0FE79C4288B5","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":"Q2816030$E8ADF0B4-40FC-456B-AF52-8410DA6D2DE5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5e4730072202800fb666866db9a8a058f589da3b","datavalue":{"value":{"text":"The complexity of the chromatic sum problem on cubic planar graphs and regular graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2816030$2C0DC1EA-97C3-41D8-8B91-10DFD3EA9A3D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2816030","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2816030"}}}}}