<?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://dk.um.si/IzpisGradiva.php?id=51939"><dc:title>Bryś, Krzysztof(PL-WASWTM); Lonc, Zbigniew(PL-WASWTM) Polynomial cases of graph decomposition: a complete solution of Holyer's problem. (English summary). - Discrete Math. 309 (2009), no. 6, 1294-1326</dc:title><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:date>2010</dc:date><dc:date>2015-07-10 15:25:38</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51939</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>