@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00759291v1> a dcat:Dataset ;
    dct:description """
              A graph G is arbitrarily partitionable (AP for short) if for every sequence (n_1, ..., n_p) of positive integers summing up to |V(G)| there exists a partition (V_1, ..., V_p) of V(G) such that G[V_i] is a connected graph on n_i vertices for every i in {1,...,p}. We show that the Cartesian product G x K_l is AP whenever G is AP and K_l is a complete graph on l >= 1 vertices.
            """ ;
    dct:identifier "hal-00759291" ;
    dct:issued "2026-06-03T03:55:44.850035"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-06-03T03:55:44.850045"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Partitioning the Cartesian product of an arbitrarily partitionable graph and a complete graph" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00759291v1/resource/59f5525f-8eb2-4d32-abcb-9b509363cd57> ;
    dcat:keyword "arbitrary-partition",
        "cartesian-product",
        "complete-graph",
        "graph",
        "infoeu-reposemanticsreport",
        "infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm",
        "reports" ;
    dcat:landingPage <https://hal.science/hal-00759291> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00759291v1/resource/59f5525f-8eb2-4d32-abcb-9b509363cd57> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-06-03T03:55:44.931715"^^xsd:dateTime ;
    dct:modified "2026-06-03T03:55:44.819321"^^xsd:dateTime ;
    dct:title "Partitioning the Cartesian product of an arbitrarily partitionable graph and a complete graph" ;
    dcat:accessURL <https://hal.science/hal-00759291> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00759291> a foaf:Document .