<?xml version="1.0" encoding="utf-8"?><!DOCTYPE Zthes SYSTEM "http://zthes.z3950.org/schema/zthes-1.0.dtd">  <Zthes><term><termId>6268</termId><termName>TEORÍA DE GRAFOS</termName><termType>PT</termType><termLanguage>es-ES</termLanguage><termVocabulary>TESAURO DE MATERIAS DE SERBIULA</termVocabulary>	<termStatus>active</termStatus>	<termApproval>approved</termApproval>	<termSortkey>TEORÍA DE GRAFOS</termSortkey><termCreatedDate>TEORÍA DE GRAFOS</termCreatedDate><termModifiedDate>2015-02-18 12:15:09</termModifiedDate><relation><relationType>UF</relationType><termId>6281</termId><termName>Teoría de gráfos--Problemas extremos</termName><termType>ND</termType></relation><relation><relationType>UF</relationType><termId>6282</termId><termName>Teoría de los gráfos</termName><termType>ND</termType></relation><relation><relationType>UF</relationType><termId>6280</termId><termName>Gráfos, Teoría de</termName><termType>ND</termType></relation><relation><relationType>BT</relationType><termId>5218</termId><termName>ANALISIS COMBINATORIO</termName><termType>PT</termType></relation><relation><relationType>BT</relationType><termId>2456</termId><termName>TOPOLOGÍA</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>5844</termId><termName>ANALISIS DE REDES (PLANIFICACION)</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6269</termId><termName>ÁRBOLES (TEORÍA DE GRAFOS)</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6270</termId><termName>CAMINOS Y CICLOS (TEORIA DE GRAFOS)</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>364</termId><termName>GRAFICOS DE BOND</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6271</termId><termName>GRAFOS ALEATORIOS</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6272</termId><termName>GRAFOS PERFECTOS</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6273</termId><termName>HIPERGRAFOS</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6274</termId><termName>MATROIDES</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6275</termId><termName>REDES DE PETRI</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6276</termId><termName>REPRESENTACIONES DE GRAFOS</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6277</termId><termName>TEORÍA DE GRAFOS TOPOLÓGICOS</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6278</termId><termName>TEORÍA DE RAMSEY</termName><termType>PT</termType></relation><relation><relationType>NT</relationType><termId>6279</termId><termName>TRAYECTORIA DE RETICULADOS</termName><termType>PT</termType></relation></term>  </Zthes>