<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><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:identifier>UDK: 519.17(049.3)</dc:identifier><dc:identifier>OceCobissID: 50093825</dc:identifier><dc:identifier>COBISS_ID: 16143193</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:STZGMBR6</dc:identifier><dc:language>sl</dc:language></metadata>
