@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-00759044v1> a dcat:Dataset ;
    dct:description """
              Consider an undirected graph G and a subgraph H of G, on the same vertex set. The q-backbone chromatic number BBCq(G,H) is the minimum k such that G can be properly coloured with colours from {1, ..., k}, and moreover for each edge of H, the colours of its ends differ by at least q. In this paper we focus on the case when G is planar and H is a forest. We give a series of NP-hardness results as well as upper bounds for BBCq(G,H), depending on the type of the forest (matching, galaxy, spanning tree). Eventually, we discuss a circular version of the problem.
            """ ;
    dct:identifier "Report N°: RR-8152" ;
    dct:issued "2026-06-03T06:21:56.429838"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-06-03T06:21:56.429844"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "(Circular) backbone colouring: tree backbones in planar graphs" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00759044v1/resource/a46fc402-48b7-4d7a-898d-0d15d77aa712> ;
    dcat:keyword "infoeu-reposemanticsreport",
        "infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm",
        "reports" ;
    dcat:landingPage <https://inria.hal.science/hal-00759044> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00759044v1/resource/a46fc402-48b7-4d7a-898d-0d15d77aa712> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-06-03T06:21:56.443213"^^xsd:dateTime ;
    dct:modified "2026-06-03T06:21:56.416803"^^xsd:dateTime ;
    dct:title "(Circular) backbone colouring: tree backbones in planar graphs" ;
    dcat:accessURL <https://inria.hal.science/hal-00759044> .

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

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