<?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=11888"><dc:title>Avoidable vertices and edges in graphs</dc:title><dc:creator>Beisegel,	Jesse	(Avtor)
	</dc:creator><dc:creator>Chudnovsky,	Maria	(Avtor)
	</dc:creator><dc:creator>Gurvich,	Vladimir	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Milanič,	Mary Agnes	(Avtor)
	</dc:creator><dc:subject>simplicial vertex</dc:subject><dc:subject>avoidable vertex</dc:subject><dc:subject>avoidable edge</dc:subject><dc:subject>avoidable path</dc:subject><dc:subject>maximum weight clique problem</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:subject>hole-cyclically orientable graph</dc:subject><dc:date>2019</dc:date><dc:date>2019-08-20 11:24:24</dc:date><dc:type>Neznano</dc:type><dc:identifier>11888</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>