<?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>Vikas, Narayan (3-SFR-SC): A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. (English summary). - J. Comput. System Sci. 71 (2005), no. 4, 406--439</dc:title><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:date>2006</dc:date><dc:date>2015-07-10 15:03:09</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51683</dc:identifier><dc:identifier>UDK: 519.17:004(049.3)</dc:identifier><dc:identifier>OceCobissID: 50093825</dc:identifier><dc:identifier>COBISS_ID: 14836569</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:75PVY6UG</dc:identifier><dc:language>sl</dc:language></metadata>
