@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-00762534v1> a dcat:Dataset ;
    dct:description """
              The Grundy index of a graph G = (V,E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G = (V,E) is NP-hard for general graphs. We also show that this problem is polynomial-time solvable for caterpillars. More specifically, we prove that the Grundy index of a caterpillar is $\\Delta(G)$ or $\\Delta(G)+1$ and present a polynomial-time algorithm to determine it exactly.
            """ ;
    dct:identifier "Report N°: RR-8171" ;
    dct:issued "2026-06-01T09:11:42.562271"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-06-01T09:11:42.562280"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Complexity of greedy edge-colouring" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00762534v1/resource/54b710a2-1bdd-4999-b372-2697a96dadee> ;
    dcat:keyword "caterpillars",
        "edge-colouring",
        "greedy-algorithm",
        "greedy-colouring",
        "infoeu-reposemanticsreport",
        "infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds",
        "line-graphs",
        "np-complete",
        "reports" ;
    dcat:landingPage <https://inria.hal.science/hal-00762534> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00762534v1/resource/54b710a2-1bdd-4999-b372-2697a96dadee> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-06-01T09:11:42.707775"^^xsd:dateTime ;
    dct:modified "2026-06-01T09:11:42.493973"^^xsd:dateTime ;
    dct:title "Complexity of greedy edge-colouring" ;
    dcat:accessURL <https://inria.hal.science/hal-00762534> .

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