@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-00758548v1> a dcat:Dataset ;
    dct:description """
              Given a graph $G$ and a spanning subgraph $T$ of $G$, a {\\it backbone $k$-colouring} for $(G,T)$ is a mapping $c:V(G)\\to\\{1,\\ldots,k\\}$ such that $|c(u)-c(v)|\\geq 2$ for every edge $uv\\in E(T)$ and $|c(u)-c(v)|\\geq 1$ for every edge $uv\\in E(G)\\setminus E(T)$. The {\\it backbone chromatic number} $BBC(G,T)$ is the smallest integer $k$ such that there exists a backbone $k$-colouring of $(G,T)$. In 2007, Broersma et al. \\cite{BFG+07} conjectured that $BBC(G,T)\\leq 6$ for every planar graph $G$ and every spanning tree $T$ of $G$. In this paper, we prove this conjecture when $T$ has diameter at most four.
            """ ;
    dct:identifier "Report N°: RR-8151" ;
    dct:issued "2026-06-03T10:39:57.806717"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-06-03T10:39:57.806723"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Backbone colouring: tree backbones with small diameter in planar graphs" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00758548v1/resource/429378e5-f3d8-46c0-80a1-e31184f6ab58> ;
    dcat:keyword "infoeu-reposemanticsreport",
        "infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm",
        "reports" ;
    dcat:landingPage <https://inria.hal.science/hal-00758548> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00758548v1/resource/429378e5-f3d8-46c0-80a1-e31184f6ab58> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-06-03T10:39:57.819312"^^xsd:dateTime ;
    dct:modified "2026-06-03T10:39:57.795347"^^xsd:dateTime ;
    dct:title "Backbone colouring: tree backbones with small diameter in planar graphs" ;
    dcat:accessURL <https://inria.hal.science/hal-00758548> .

<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-00758548> a foaf:Document .

