@prefix psr: <http://data.loterre.fr/ark:/67375/PSR> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

psr:-NW7M0NW6-L
  skos:prefLabel "théorème de Kőnig"@fr, "Kőnig's theorem"@en ;
  a skos:Concept ;
  skos:related psr:-ST2K7066-3 .

psr:-T1J15DPM-T
  skos:prefLabel "graphe"@fr, "graph"@en ;
  a skos:Concept ;
  skos:narrower psr:-ST2K7066-3 .

psr:-V1WXCPFV-C
  skos:prefLabel "complete bipartite graph"@en, "graphe biparti complet"@fr ;
  a skos:Concept ;
  skos:broader psr:-ST2K7066-3 .

psr:-VT6FL5Z9-1
  skos:prefLabel "Edmonds matrix"@en, "matrice d'Edmonds"@fr ;
  a skos:Concept ;
  skos:broader psr:-ST2K7066-3 .

psr: a skos:ConceptScheme .
psr:-ST2K7066-3
  skos:altLabel "bigraph"@en ;
  skos:narrower psr:-VT6FL5Z9-1, psr:-V1WXCPFV-C, psr:-CRCPSSRT-M ;
  skos:prefLabel "graphe biparti"@fr, "bipartite graph"@en ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Bipartite_graph>, <https://fr.wikipedia.org/wiki/Graphe_biparti> ;
  skos:broader psr:-T1J15DPM-T ;
  skos:inScheme psr: ;
  dc:modified "2024-10-18"^^xsd:date ;
  skos:related psr:-NW7M0NW6-L ;
  skos:definition """En théorie des graphes, un graphe est dit biparti si son ensemble de sommets peut être divisé en deux sous-ensembles disjoints U et V tels que chaque arête ait une extrémité dans U et l'autre dans V.  
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Graphe_biparti">https://fr.wikipedia.org/wiki/Graphe_biparti</a>)"""@fr, """In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is, every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Bipartite_graph">https://en.wikipedia.org/wiki/Bipartite_graph</a>)"""@en ;
  a skos:Concept .

psr:-CRCPSSRT-M
  skos:prefLabel "biregular graph"@en, "graphe birégulier"@fr ;
  a skos:Concept ;
  skos:broader psr:-ST2K7066-3 .