@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: a skos:ConceptScheme .
psr:-Z52SX3PF-B
  skos:prefLabel "graphe non orienté"@fr, "undirected graph"@en ;
  a skos:Concept ;
  skos:narrower psr:-GD4N65WW-T .

psr:-T51FGXT8-W
  skos:prefLabel "dessin d'enfant"@en, "dessin d'enfant"@fr ;
  a skos:Concept ;
  skos:broader psr:-GD4N65WW-T .

psr:-GD4N65WW-T
  skos:exactMatch <https://fr.wikipedia.org/wiki/Graphe_connexe>, <https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Connected_vertices_and_graphs> ;
  skos:narrower psr:-T51FGXT8-W ;
  skos:definition """Un graphe non orienté G = (V, E) est dit connexe si quels que soient les sommets u et v de V, il existe une chaîne reliant u à v.
<br/>Un sous-graphe connexe maximal d'un graphe non orienté quelconque est une composante connexe de ce graphe.  
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Graphe_connexe">https://fr.wikipedia.org/wiki/Graphe_connexe</a>)"""@fr, """In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected. If the two vertices are additionally connected by a path of length 1 (that is, they are the endpoints of a single edge), the vertices are called adjacent.
<br/>A graph is said to be connected if every pair of vertices in the graph is connected. This means that there is a path between every pair of vertices. An undirected graph that is not connected is called disconnected. An undirected graph G is therefore disconnected if there exist two vertices in G such that no path in G has these vertices as endpoints. A graph with just one vertex is connected. An edgeless graph with two or more vertices is disconnected. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Connected_vertices_and_graphs">https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Connected_vertices_and_graphs</a>)"""@en ;
  dc:modified "2024-10-18"^^xsd:date ;
  a skos:Concept ;
  skos:prefLabel "connected graph"@en, "graphe connexe"@fr ;
  skos:broader psr:-Z52SX3PF-B ;
  skos:inScheme psr: .