<?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=18796"><dc:title>Classes of graphs with tree-independence number at most two</dc:title><dc:creator>Redžić,	Mirza	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Mentor)
	</dc:creator><dc:creator>Dallard,	Clément Jean	(Komentor)
	</dc:creator><dc:subject>tree decomposition</dc:subject><dc:subject>treewidth</dc:subject><dc:subject>tree-independence number</dc:subject><dc:subject>induced minor</dc:subject><dc:subject>H-free graph</dc:subject><dc:subject>series parallel graph</dc:subject><dc:publisher>[M. Redžić]</dc:publisher><dc:date>2022</dc:date><dc:date>2022-09-20 10:29:52</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>18796</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>