<?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=1513"><dc:title>On the recognition of k-equistable graphs</dc:title><dc:creator>Levit,	Vadim E.	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Tankus,	D.	(Avtor)
	</dc:creator><dc:subject>maximal stable set</dc:subject><dc:subject>equistable graph</dc:subject><dc:subject>polynomial time algorithm</dc:subject><dc:subject/><dc:date>2012</dc:date><dc:date>2013-10-15 12:06:04</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>1513</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>