<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=17025"><dc:title>A complexitystudy of distance variants of covering and domination problems in H-free graphs</dc:title><dc:creator>Krbezlija,	Mirza	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Mentor)
	</dc:creator><dc:creator>Dallard,	Clément Jean	(Komentor)
	</dc:creator><dc:subject>distance-k dominating set</dc:subject><dc:subject>distance-k edge dominating set</dc:subject><dc:subject>distance-k vertex cover</dc:subject><dc:subject>distance k-edge cover</dc:subject><dc:subject>H-free graph</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:subject>NP-complete problem</dc:subject><dc:subject>dichotomy theorem</dc:subject><dc:publisher>[M. Krbezlija]</dc:publisher><dc:date>2021</dc:date><dc:date>2021-10-18 09:23:35</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>17025</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>